#include "paint.h"
#include<bits/stdc++.h>
using namespace std;
#define lli int
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define MAX 100000
#define MK 100000
lli n,m,k,res,pos,mejor,dif,a,last, par;
//valores de 0 a m
unordered_map<int, int> lejos[2];
vector<int> contratistas[MK];
lli top[MAX+2];
//checar memoria
int minimumInstructions(int N, int M, int K, std::vector<int> C,std::vector<int> A, std::vector<std::vector<int>> B) {
n = N;
m = M;
k = K;
rep(i,0,m-1) {
rep(j,0,A[i]-1) {
contratistas[B[i][j]].push_back(i);
}
}
repa(i,n-1,0) {
top[i] = 0;
lejos[par].clear();
for(auto cont : contratistas[C[i]]) {
int sigcont = (cont < m - 1) ? cont + 1 : 0;
int v = (lejos[par ^ 1].count(sigcont)) ? lejos[par ^ 1][sigcont] + 1 : 1;
lejos[par][cont] = min(m, v);
top[i] = max(top[i], min(m, v));
}
par ^= 1;
}
if (top[0] < m) return -1;
pos = m;
last = 0;
res = 1;
rep(i,1,n-1) {
if (top[i] == m) last = i;
if (i == pos) {
pos = last + m;
res++;
}
}
if (pos < n) return -1;
else return res;
}
