/*input
8 3 5
3 3 1 3 4 4 2 2
3 0 1 2
2 2 3
2 3 4
*/
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define ALL(x) x.begin(),x.end()
#define pii pair<int,int>
#define f first
#define s second
#define MXTO(a,b) a=max(a,b)
#define MNTO(a,b) a=min(a,b)
#define sz(x) (int)x.size()
#define pb push_back
const int maxn=1e5+5;
int n,m,k;
int dp[maxn];
set<int> ok[maxn];
const int INF=0x3f3f3f3f;
vector<int> v[maxn];
int minimumInstructions(
int N, int M, int K, std::vector<int> C,
std::vector<int> A, std::vector<std::vector<int>> B) {
C.emplace(C.begin(),0);
n=N,m=M,k=K;
multiset<int> ms;
ms.insert(0);
REP1(i,m-1) dp[i]=INF,ms.insert(dp[i]);
REP(i,m){
for(int x:B[i]) ok[x].insert(i);
}
REP1(i,n){
for(int x:ok[C[i]]) v[((x-i)%m+m)%m].pb(i);
}
for(int i=m;i<=n;i++){
int mn=(*ms.begin());
dp[i]=INF;
vector<int> ans;
for(int a:ok[C[i]]){
int cnt=upper_bound(ALL(v[((a-i)%m+m)%m]),i)-lower_bound(ALL(v[((a-i)%m+m)%m]),i-m+1);
if(cnt==m){
dp[i]=mn+1;
break;
}
}
ms.erase(ms.find(dp[i-m]));
ms.insert(dp[i]);
}
if(dp[n]>=INF) dp[n]=-1;
return dp[n];
}
