#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e5+5;
const ld pi=acos(-1);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
ll minimumInstructions(ll n,ll m,ll k,vector<ll> color,vector<ll> a,vector<vector<ll> > b){
vector<vector<ll> > loc(k);
for(int i=0;i<m;i++){
for(int j=0;j<SZ(b[i]);j++)loc[b[i][j]].pb(i);
}
vector<vector<ll> > it(m);
for(int i=0;i<n;i++){
for(int j:loc[color[i]]){
it[((j-i)%m+m)%m].pb(i);
}
}
vector<ll> r(n);
for(const auto &v:it){
ll lst=n+1,len=0;
for(int i=SZ(v)-1;i>=0;i--){
if(v[i]+1!=lst)len=0;
++len;
r[v[i]]=max(r[v[i]],len);
lst=v[i];
}
}
vector<ll> lis;
for(int i=0;i<n;i++)if(r[i]>=m)lis.pb(i);
ll ans=0;
for(int R=0,id=0;R<n;){
while(id<SZ(lis)&&lis[id]<=R)++id;
if(id==0)return -1;
ll L=lis[id-1];
if(L+m<=R)return -1;
++ans;
R=L+m;
}
return ans;
}
