#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
int minimumInstructions(int n, int m, int K, std::vector<int> C, std::vector<int> A, std::vector<std::vector<int>> B) {
vii a(50000,vi(2,0));
vii st(K);
vector<bool> arr(n,0);
REP(i,0,m)REP(j,0,A[i])st[B[i][j]].PB(i);
vector<queue<int>> q(2);
REP(i,0,n){
int t=i%2;
while(!q[t].empty()){
a[q[t].front()][t]=0;
q[t].pop();
}
REP(j,0,st[C[i]].size()){
a[st[C[i]][j]][t]=a[(st[C[i]][j]-1+m)%m][1-t]+1;
if(a[st[C[i]][j]][t]>=m)arr[i]=1;
q[t].push(st[C[i]][j]);
}
}
int ans=0,pos=0;
while(pos<n){
bool f=1;
for(int i=min(n,pos+m)-1;i>=pos;i--)if(arr[i]){
f=0;
pos=i+1;
break;
}
if(f)return -1;
ans++;
}
return ans;
}
