#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cstring>

using namespace std;

const int N = 2e5+;

int t, n, q, tot;

int l, r;

int a[N];

int root[N], vis[N];

int ans[N];

struct node {

    int l, r, sum;

}tre[N*];

void update(int l, int r, int &x, int y, int pos, int val) {

    tre[++tot] = tre[y];

    tre[tot].sum += val;

    x = tot;

    if(l==r) return ;

    int mid = l+r>>;

    if(pos<=mid) update(l, mid, tre[x].l, tre[y].l, pos, val);

    else update(mid+, r, tre[x].r, tre[y].r, pos, val);

}

int query(int l, int r, int x, int ql, int qr) {

    if(ql<=l&&r<=qr) return tre[x].sum;

    int mid = l+r>>;

    int res = ;

    if(ql<=mid) res += query(l, mid, tre[x].l, ql, qr);

    if(qr>mid) res += query(mid+, r, tre[x].r, ql, qr);

    return res;

}

int find_kth(int l, int r, int x, int k) {

    if(l==r) return l;

    int mid = l+r>>;

    int t = tre[tre[x].l].sum;

    if(t>=k) return find_kth(l, mid, tre[x].l, k);

    return find_kth(mid+, r, tre[x].r, k-t);

}

int main() {

    scanf("%d", &t);

    for(int casee = ; casee <= t; casee++) {

        memset(vis, , sizeof(vis));

        tot = ;

        scanf("%d%d", &n, &q);

        root[n+] = ;

        for(int i = ; i <= n; i++) scanf("%d", &a[i]);

        for(int i = n; i >= ; i--) {

            update(, n, root[i], root[i+], i, );

            if(vis[a[i]]) update(, n, root[i], root[i], vis[a[i]], -);

            vis[a[i]] = i;

        }

        ans[] = ;

        printf("Case #%d: ", casee);

        for(int i = ; i <= q; i++) {

            scanf("%d%d", &l, &r);

            int tt = l;

            l = min((l+ans[i-])%n+, (r+ans[i-])%n+);

            r = max((tt+ans[i-])%n+, (r+ans[i-])%n+);

            int k = query(, n, root[l], l, r);

            ans[i] = find_kth(, n, root[l], (k+)/);

            printf("%d", ans[i]);

            if(i!=q) printf(" ");

        }

        puts("");

    }

}