#include <bits/stdc++.h>

#define rep(i, a, b) for (int i = (a); i <= (b); i ++)
#define dep(i, a, b) for (int i = (a); i >= (b); i --)

using namespace std;
typedef long long ll;

const int N = 1e5 + 5;
int n, m, a[N], b[N];

int mp[N], t[N];
struct node {
  int l, r, o;
  bool operator < (const node &rhs) const {
    return mp[l] != mp[rhs.l] ? mp[l]  < mp[rhs.l] : r < rhs.r;
  }
} d[N];

ll sum, ans[N];

int main() {
  cin >> n >> m;
  b[0] = 0;
  rep(i, 1, n) {
    int x; cin >> x;
    a[i] = a[i - 1] ^ ((x - 1) | (1 << 20)), b[i] = a[i]; 
  }
  sort(b + 1, b + 1 + n);
  int k = unique(b + 1, b + 1 + n) - (b + 1);
  rep(i, 1, n) a[i] = lower_bound(b + 1, b + 1 + k, a[i]) - b;
  int B = sqrt(n);
  rep(i, 1, n) mp[i] = (i - 1) / B + 1;
  rep(i, 1, m) cin >> d[i].l >> d[i].r, d[i].l --, d[i].o = i;
  sort(d + 1, d + 1 + m);
  int l = 0, r = -1;
  rep(i, 1, m) {
    while ( r < d[i].r ) sum += t[a[++r]] ++;
    while ( l > d[i].l ) sum += t[a[--l]] ++;
    while ( r > d[i].r ) sum -= --t[a[r--]];
    while ( l < d[i].l ) sum -= --t[a[l++]];
    auto calc = [&] (ll x) {
      return x * (x + 1) / 2;
    };
    ans[d[i].o] = calc(d[i].r - d[i].l) - sum;
  }
  rep(i, 1, m) cout << ans[i] << '\n';
  return 0;
}