#include <iostream>
using namespace std;
int n, q;
struct node {
    int l, r, tg;
} T[20000005];
int ncnt;
struct Segment_Tree {
    void Add(int &p, int q, int l, int r, int L, int R) {
        T[p = ++ncnt] = T[q];
        if (L <= l && r <= R) {
            ++T[p].tg;
            return;
        }
        int mid = (l + r) >> 1;
        if (L <= mid) 
            Add(T[p].l, T[q].l, l, mid, L, R);
        if (R > mid) 
            Add(T[p].r, T[q].r, mid + 1, r, L, R);
    }
    void Merge(int &p, int q1, int q2, int l, int r, int x, int t1, int t2) {
        p = ++ncnt, t1 += T[q1].tg, t2 += T[q2].tg;
        if (r < x) {
            T[p] = T[q1];
            T[p].tg = t1;
            return;
        }
        if (l >= x) {
            T[p] = T[q2];
            T[p].tg = t2;
            return;
        }
        int mid = (l + r) >> 1;
        Merge(T[p].l, T[q1].l, T[q2].l, l, mid, x, t1 + T[p].tg, t2 + T[q].tg);
        Merge(T[p].r, T[q1].r, T[q2].r, mid + 1, r, x, t1 + T[p].tg, t2 + T[q].tg);
    }
    int Query(int o, int l, int r, int x) {
        if (!o) 
            return 0;
        if (l == r) 
            return T[o].tg;
        int mid = (l + r) >> 1;
        if (x <= mid) 
            return T[o].tg + Query(T[o].l, l, mid, x);
        else 
            return T[o].tg + Query(T[o].r, mid + 1, r, x);
    }
} seg;
int rt[300005], ap[300005], a[300005];
int main() {
    cin >> n >> q;
    for (int i = 1; i <= n; i++) cin >> a[i], ap[a[i]] = n + 1;
    for (int i = n; i; i--) {
        seg.Merge(rt[i], rt[i + 1], rt[ap[a[i]] + 1], 1, n, ap[a[i]], 0, 0);
        seg.Add(rt[i], rt[i], 1, n, i, ap[a[i]] - 1);
        ap[a[i]] = i;
    }
    int lans = 0;
    while (q--) {
        int l, r;
        cin >> l >> r;
        l ^= lans, r ^= lans;
        cout << (lans = seg.Query(rt[l], 1, n, r)) << "\n";
    }
    return 0;
}
/*
5 5
3 3 1 1 1
5 5
3 4
3 3
0 5
3 5
*/