#include <cstdio>
#include <cstring>
#include <algorithm>
typedef long long ll;
const int N = 100005, B = 340, M = (1 << 22) + 5;
int n, m, val[N], bel[N];
struct node
{
	int l, r, id;
} q[N];
inline bool cmp(node a, node b)
{
	return bel[a.l] == bel[b.l] ? a.l < b.l : (bel[a.l] & 1 ? a.r > b.r : a.r < b.r);
}
int bac[M], ptl, ptr;
ll now;
inline void add(int k)
{
	now += bac[k]++;
	return;
}
inline void del(int k)
{
	now -= --bac[k];
	return;
}
inline void fix(int l, int r)
{
	while(ptl > l)
		add(val[--ptl]);
	while(ptr < r)
		add(val[++ptr]);
	while(ptl < l)
		del(val[ptl++]);
	while(ptr > r)
		del(val[ptr--]);
	return;
}
ll ans[N];
int main(void)
{
	scanf("%d%d", &n, &m);
	for(int i = 1;i <= n;++i)
		scanf("%d", val + i), val[i] = ((val[i] - 1) | (1 << 20)) ^ val[i - 1];
	for(int i = 0;i <= n;++i)
		bel[i] = i / B + 1;
	for(int i = 1;i <= m;++i)
		scanf("%d%d", &q[i].l, &q[i].r), --q[i].l, q[i].id = i;
	ptl = ptr = 0, bac[val[0]] = 1;
	std::sort(q + 1, q + 1 + m, cmp);
	for(int i = 1;i <= m;++i)
		fix(q[i].l, q[i].r), ans[q[i].id] = 1ll * (q[i].r - q[i].l) * (q[i].r - q[i].l + 1) / 2 - now;
	for(int i = 1;i <= m;++i)
		printf("%lld\n", ans[i]);
	return 0;
}