#define pragma

#ifdef pragma
//#pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // pragma

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define all(x) begin(x), end(x)
#define pb push_back
#define x first
#define y second
// #define int long long
#define zero(two) memset(two, 0, sizeof(two))

using namespace std;
using namespace __gnu_pbds;


typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef long double ld;
typedef vector<vi> matrix;
template<typename T>
using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ld PI = atan2(0, -1);

void seriy() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    cout << fixed << setprecision(10);
    #ifdef _offline
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
}

const int MAXN = 3e5 + 10;
const int MAXM = 600;
const int INF = 1e9 + 7;
const int MOD = 998244353;
const int MAXLOG = 24;

struct node {
    int val = 0;
    node *left = nullptr;
    node *right = nullptr;

    node() {

    }

    node(int vl, node *lft, node *rght) {
        val = vl;
        left = lft;
        right = rght;
    }
};

vi a;

void build(node *v, int tl, int tr) {
    if(tl == tr) {
        return;
    }
    int tm = (tl + tr) >> 1;
    v->left = new node();
    v->right = new node();
    build(v->left, tl, tm);
    build(v->right, tm + 1, tr);
}

int get(node *v, int tl, int tr, int l, int r) {
    if(tl > r || tr < l) {
        return 0;
    }
    if(tl >= l && tr <= r) {
        return v->val;
    }
    int tm = (tl + tr) >> 1;
    if(v->left == nullptr) {
        v->left = new node();
    }
    if(v->right == nullptr) {
        v->right = new node();
    }
    int left = get(v->left, tl, tm, l, r);
    int right = get(v->right, tm + 1, tr, l, r);
    return left + right;
}

void update(node *v, node *v2, int tl, int tr, int pos, int val) {
    if(tl == tr) {
        v->val = val;
        return;
    }
    int tm = (tl + tr) >> 1;
    if(pos <= tm) {
        v->right = v2->right;
        v->left = new node();
        update(v->left, v2->left, tl, tm, pos, val);
    }
    else {
        v->left = v2->left;
        v->right = new node();
        update(v->right, v2->right, tm + 1, tr, pos, val);
    }
    // if(v == nullptr) v = new node();
    if(v->left == nullptr) v->left = new node();
    if(v->right == nullptr) v->right = new node();
    v->val = v->left->val + v->right->val;
    // cerr << tl << " " << tr << '\n';
}

signed main() {
    seriy();
    int n, m;
    cin >> n >> m;
    a.resize(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<node*> roots(n + 1);
    roots[0] = new node();
    build(roots[0], 1, n + 1);
    vi last(m + 1, -1);
    for(int i = 1; i <= n; i++) {
        roots[i] = new node();
        // cerr << i << '\n'
        update(roots[i], roots[i - 1], 1, n + 1, i, 1);
        node *cur = new node();
        cur->val = roots[i]->val;
        cur->left = roots[i]->left;
        cur->right = roots[i]->right;
        // cerr << i << " " << 1 << '\n';
        if(last[a[i - 1]] != -1) {
            roots[i] = new node();
            // cerr << last[a[i - 1]] << " " << -1 << '\n';
            update(roots[i], cur, 1, n + 1, last[a[i - 1]], 0);
        }
        // cerr << '\n';
        last[a[i - 1]] = i;
    }
    int q;
    cin >> q;
    int p = 0;
    for(int i = 0; i < q; i++) {
        int x, y;
        cin >> x >> y;
        int l = (x + p) % n + 1;
        int k = (y + p) % m + 1;
        // cout << l << " " << k << '\n';
        int tl = l - 1, tr = n + 1;
        while(tr - tl > 1) {
            int mid = (tr + tl) >> 1;
            int right = get(roots[mid], 1, n + 1, l, mid);
            // cout << l << " " << mid << " " << right << '\n';
            // cout << mid << " " << right - left << '\n';
            if(right >= k) {
                tr = mid;
            }
            else {
                tl = mid;
            }
        }
        p = ((tr == n + 1) ? 0 : tr);
        cout << p << '\n';
    }
    return 0;
}