#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=2e5+10;
const int M=5e4+10;
const int mod=1000000007;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1000000007;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
int a[N],w[N],ans[N];
int siz,root[N],ls[36*N],rs[36*N],sum[36*N];
void update(int x,int &y,int l,int r,int w,int z) {
y=++siz;sum[y]=sum[x]+z;
ls[y]=ls[x];rs[y]=rs[x];
if (l==r) return ;
int mid=(l+r)>>1;
if (w<=mid) update(ls[x],ls[y],l,mid,w,z);
else update(rs[x],rs[y],mid+1,r,w,z);
}
int query(int x,int l,int r,int L,int R) {
if (l==L&&r==R) return sum[x];
int mid=(l+r)>>1;
if (R<=mid) return query(ls[x],l,mid,L,R);
else if (L>mid) return query(rs[x],mid+1,r,L,R);
else return query(ls[x],l,mid,L,mid)+query(rs[x],mid+1,r,mid+1,R);
}
int find_k(int x,int l,int r,int k) {
if (l==r) return l;
int mid=(l+r)>>1;
if (sum[ls[x]]>=k) return find_k(ls[x],l,mid,k);
else return find_k(rs[x],mid+1,r,k-sum[ls[x]]);
}
int main()
{
int i,g,n,m,x,ca,l,r,T;
scanf("%d", &T);
for (ca=1;ca<=T;ca++) {
scanf("%d%d", &n, &m);
for (i=1;i<=n;i++) scanf("%d", &a[i]);
ans[0]=siz=root[n+1]=0;
memset(w,0,sizeof(w));
for (i=n;i;i--) {
update(root[i+1],x,1,n,i,1);
if (w[a[i]]) update(x,root[i],1,n,w[a[i]],-1);
else root[i]=x;
w[a[i]]=i;
}
for (i=1;i<=m;i++) {
scanf("%d%d", &l, &r);
l=(ans[i-1]+l)%n+1;
r=(ans[i-1]+r)%n+1;
if (l>r) swap(l,r);
g=query(root[l],1,n,l,r);
ans[i]=find_k(root[l],1,n,g+1>>1);
}
printf("Case #%d:", ca);
for (i=1;i<=m;i++) printf(" %d", ans[i]);
printf("\n");
}
return 0;
}