#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
const int M = MAXN * 40;
int n, q, tot, k;
int a[MAXN];
int T[M], lson[M], rson[M], c[M];
vector<int> vec[MAXN];
int build(int l, int r) {
  int root = tot++;
  c[root] = 0;
  if (l != r) {
    int mid = (l + r) >> 1;
    lson[root] = build(l, mid);
    rson[root] = build(mid + 1, r);
  }
  return root;
}
int update(int root, int pos, int val) {
  int newroot = tot++, tmp = newroot;
  c[newroot] = c[root] + val;
  int l = 1, r = n;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (pos <= mid) {
      lson[newroot] = tot++;
      rson[newroot] = rson[root];
      newroot = lson[newroot];
      root = lson[root];
      r = mid;
    } else {
      rson[newroot] = tot++;
      lson[newroot] = lson[root];
      newroot = rson[newroot];
      root = rson[root];
      l = mid + 1;
    }
    c[newroot] = c[root] + val;
  }
  return tmp;
}
int query(int root, int pos) {
  int ret = 0;
  int l = 1, r = n;
  while (pos < r) {
    int mid = (l + r) >> 1;
    if (pos <= mid) {
      r = mid;
      root = lson[root];
    } else {
      ret += c[lson[root]];
      root = rson[root];
      l = mid + 1;
    }
  }
  return ret + c[root];
}
int main() {
  while (scanf("%d%d", &n, &k) == 2) {
    tot = 0;
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    T[n + 1] = build(1, n);
    for (int i = n; i >= 1; i--) {
      vec[a[i]].push_back(i);
      int x = vec[a[i]].size();
      if (x <= k) {
        T[i] = update(T[i + 1], i, 1);
      } else {
        int tmp = update(T[i + 1], vec[a[i]][x - k - 1], -1);
        T[i] = update(tmp, i, 1);
      }
    }
    scanf("%d", &q);
    int ans = 0;
    while (q--) {
      int l, r;
      scanf("%d%d", &l, &r);
      l = (l + ans) % n + 1;
      r = (r + ans) % n + 1;
      if (l > r) swap(l, r);
      ans = query(T[l], r);
      printf("%d\n", ans);
    }
  }
  return 0;
}
