#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
const int nax = 1e5 + 3;
vector<int> col_to_wall[nax];
set<int>cand[nax];
bool good[nax];
int minimumInstructions(
int N, int M, int K, vector<int> C,
vector<int> A, vector<vector<int>> B) {
for(int i=0; i<N; ++i) {
col_to_wall[C[i]].push_back(i);
}
for(int i=0; i<M; ++i) {
for(int j=0; j<A[i]; ++j) {
for(int x : col_to_wall[B[i][j]]) {
cand[x].insert(i);
}
}
}
set<int>prev_reject;
int prev_succ = -1;
for(int i=0; i<=N-M; ++i) {
set<int>cur_reject;
int cur_succ = -1;
for(int j : cand[i]) {
int pre_tag = (j-1+M)%M;
bool yasss = true;
if(pre_tag==prev_succ) {
if(cand[i+M-1].count((j+M-1)%M)) {
cur_succ = j;
break;
} else {
cur_reject.insert(j);
continue;
}
} else if(prev_reject.count(pre_tag)) {
cur_reject.insert(j);
continue;
}
for(int l=0; l<M; ++l) {
yasss &= cand[i+l].count((j+l)%M);
if(!yasss) break;
}
if(yasss) {
cur_succ = j;
break;
} else {
cur_reject.insert(j);
}
}
prev_reject = cur_reject;
prev_succ = cur_succ;
if(cur_succ!=-1) {
good[i] = 1;
}
}
if(!good[0]) return -1;
int last = 0, pending = -1;
int ans = 1;
for(int i=1; i<N; ++i) {
if(good[i]) {
pending = i;
}
if(last+M==i) {
if(pending==-1) return -1;
last = pending;
pending = -1;
++ans;
}
}
return ans;
}
