#include "paint.h"
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
using namespace std;
const int N = 1e5+5, K = 1e5+5, mod = 1e9+7;
unordered_map<int, int> mx[N];
vector<int> lst[K];
bool bl[N];
int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> a, vector<vector<int>> b) {
for (int i=0; i<m; i++) {
for (int j=0; j<a[i]; j++) lst[b[i][j]].pb(i);
}
for (int i=0; i<n; i++) {
for (int j=0; j<sz(lst[c[i]]); j++) {
mx[lst[c[i]][j]][i] = mx[(lst[c[i]][j]-1+m)%m][(i-1+n)%n]+1;
if (mx[lst[c[i]][j]][i]>=m) bl[i] = 1;
}
}
for (int i=0; i<n; i++) {
for (int j=0; j<sz(lst[c[i]]); j++) {
mx[lst[c[i]][j]][i] = mx[(lst[c[i]][j]-1+m)%m][(i-1+n)%n]+1;
if (mx[lst[c[i]][j]][i]>=m) bl[i] = 1;
}
}
int ans = 0, idx = 0;
while (idx<n) {
bool ok = 0;
for (int i=min(n, idx+m)-1; i>=idx; i--) {
if (bl[i]) {
ok = 1;
idx = i+1;
break;
}
}
if (!ok) return -1;
ans++;
}
return ans;
}
