// Petrozavodsk Summer 2022. Day 2. ZJU Contest 1 Problem K Great Party
#include <bits/stdc++.h>
using LL = long long;
const int N = 1e5 + 5;
const int M = 3e6 + 5;
struct Query {int l, r, id;};

LL ans[N];
Query qry[N];
int n, q, a[N], bel[N], block_size;

int main() {
    scanf("%d%d", &n, &q);
    block_size = std::sqrt(n);
    a[0] = (1 << 20);
    for (int i = 1; i <= n; i++) {
        scanf("%d", a + i);
        (a[i] |= 1 << 20) ^= a[i - 1];
        bel[i] = (i - 1) / block_size + 1;
    }
    for (int i = 1, l, r; i <= q; i++) {
        scanf("%d%d", &l, &r);
        qry[i] = {l - 1, r, i};
    }
    std::sort(qry + 1, qry + q + 1, [](Query x, Query y) {return bel[x.l] == bel[y.l] ? x.r < y.r : x.l < y.l;});
    for (int i = 1, l = 0, r = -1; i <= q; i++) {
        static LL sum;
        static int c[M];
        while (l > qry[i].l) sum += c[a[--l]]++;
        while (r < qry[i].r) sum += c[a[++r]]++;
        while (l < qry[i].l) sum -= --c[a[l++]];
        while (r > qry[i].r) sum -= --c[a[r--]];
        ans[qry[i].id] = (1ll * (r - l) * (r - l + 1) >> 1) - sum;
    }
    for (int i = 1; i <= q; i++) printf("%lld\n", ans[i]);
    return 0;
}