#include <bits/stdc++.h>
using namespace std;
#define fo(v, a, b) for(int v = a; v <= b; v++)
#define fr(v, a, b) for(int v = a; v >= b; v--)
#define cl(a, v) memset(a, v, sizeof(a))

const int N = 3e5 + 10;

int n, m, Q, a[N], mark[N], f[N];

struct node {  int lc, rc, v;  } t[N << 7]; int tot, rt[N];
void insert(int &p, int q, int l, int r, int ql, int qr, int V) {
    int pre = p; p = ++tot, t[p] = t[pre];
    if(ql <= l && r <= qr) return t[p] = t[q], t[p].v += V, void();
    int mid = (l + r) >> 1;
    if(ql <= mid) insert(t[p].lc, t[q].lc, l, mid, ql, qr, V + t[q].v);
    if(qr > mid) insert(t[p].rc, t[q].rc, mid + 1, r, ql, qr, V + t[q].v);
}
int query(int p, int l, int r, int x) {
    if(p == 0 || l == r) return t[p].v;
    int mid = (l + r) >> 1;
    if(x <= mid) return query(t[p].lc, l, mid, x) + t[p].v;
    return query(t[p].rc, mid + 1, r, x) + t[p].v;
}

int Query(int l, int r) {
    r++; return query(rt[l], 1, m, r);
}

int main()
{
    scanf("%d%d", &n, &Q), m = n + 1;
    fo(i, 1, n) scanf("%d", &a[i]), mark[i] = n + 1;
    fr(i, n, 1) f[i] = mark[a[i]] + 1, mark[a[i]] = i;

    fr(i, n, 1) {
        int p = f[i];
        if(i + 1 <= p - 1)
            insert(rt[i], rt[i + 1], 1, m, i + 1, p - 1, 1);
        if(p <= m) insert(rt[i], rt[f[i]], 1, m, p, m, 0);
    }

    int last = 0;
    while(Q--) {
        int l, r; scanf("%d%d", &l, &r), l ^= last, r ^= last;
        printf("%d\n", last = Query(l, r));
    }

    return 0;
}