#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+100;
const int ub=1e6;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
if(y==0) return x;
return gcd(y,x%y);
}
int n,k,a[maxn],q,ans=0;
int cnt[maxn],pre[maxn],nxt[maxn],head[maxn],pos[maxn];
int root[maxn],tot=0,ch[maxn*30][2],val[maxn*30];
void update(int old,int &cur,int l,int r,int pos){
cur=++tot;
ch[cur][0]=ch[old][0];
ch[cur][1]=ch[old][1];
val[cur]=val[old];
if(l==r){
val[cur]++;
return ;
}
int mid=l+r>>1;
if(pos<=mid) update(ch[old][0],ch[cur][0],l,mid,pos);
if(mid<pos) update(ch[old][1],ch[cur][1],mid+1,r,pos);
val[cur]=val[ch[cur][0]]+val[ch[cur][1]];
}
int query(int rt,int l,int r,int L,int R){
if(L<=l&&r<=R) return val[rt];
int mid=l+r>>1,ans=0;
if(L<=mid) ans+=query(ch[rt][0],l,mid,L,R);
if(mid<R) ans+=query(ch[rt][1],mid+1,r,L,R);
return ans;
}
int main(){
ios::sync_with_stdio(false);
cin>>n>>k;
rep(i,1,n+1) cin>>a[i];
cin>>q;
nxt[n+1]=n+1;
for(int i=n;i>=1;i--){
nxt[i]=head[a[i]];
head[a[i]]=i;
}
mst(head,0);
rep(i,1,n+1){
pre[i]=head[a[i]];
head[a[i]]=i;
}
for(int i=n;i>=1;i--) head[a[i]]=i;
rep(i,1,n+1){
cnt[a[i]]++;
if(cnt[a[i]]<=k) pos[i]=0;
else if(cnt[a[i]]==k+1) pos[i]=head[a[i]];
else pos[i]=nxt[pos[pre[i]]];
}
rep(i,1,n+1)
update(root[i-1],root[i],0,n,pos[i]);
rep(i,0,q){
int l,r;cin>>l>>r;
l=(l+ans)%n+1,r=(r+ans)%n+1;
if(l>r) swap(l,r);
ans=r-l+1-query(root[r],0,n,l,r);
cout<<ans<<"\n";
}
return 0;
}