#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)
using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;
//Note to self: Check for overflow
#include "paint.h"
int upizdi(int i, int n)
{
i%=n;
if (i<0) i+=n;
return i;
}
vector<int> koji[100005]; //koji kontraktori sadrze ovu boju, svkk su indexirani
vector<int> poz[100005]; //reindeksirane kontrakcije
bool chiba[100005]; //da li siba, na osnovu toga racuna minimalan broj poteza
int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> a, vector<vector<int>> b)
{
ff(i,0,m) for (auto it : b[i]) koji[it].pb(i);
ff(i,0,n) for (auto kont : koji[c[i]]) poz[upizdi(kont-i,m)].pb(i);
ff(i,0,m)
{
int uzo=1;
if (uzo>=m) chiba[poz[i][0]-m+1]=1;
ff(j,1,(int)poz[i].size())
{
if (poz[i][j]-poz[i][j-1]==1) uzo++;
else uzo=1;
if (uzo>=m) chiba[poz[i][j]-m+1]=1;
}
}
int poslednji=-mod,snaga=0,ans=0;
ff(i,0,n)
{
if (chiba[i]) poslednji=i;
if (snaga<=0)
{
if (i>=poslednji+m) return -1;
snaga=poslednji+m-i,ans++;
}
snaga--;
}
return ans;
}
//Note to self: Check for overflow
/*
8 3 5
3 3 1 3 4 4 2 2
3 0 1 2
2 2 3
2 3 4
*/
