#include<bits/stdc++.h>
using std::cin;
using std::cout;
using namespace std::ranges;
using u64 = unsigned long long;
const int N = 100005;
const int mod = 998244353;
using ll = long long;
// std::map<std::vector<int>, int> dp[N][N * N];
int n, q;
int a[N];
int pre[N];
int cnt[2][N * 15];
struct qy { int l, r, id; };
std::vector<qy> Q;
ll ans[N];
int get(int l, int r, int p) {
	return r - l + 1 - cnt[p & 1][pre[p]];
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> q;
	for(int i = 1;i <= n;++i) {
		cin >> a[i];
		pre[i] = pre[i - 1] ^ a[i];
	}
	for(int i = 1, l, r;i <= q;++i) {
		cin >> l >> r;
		-- l;
		Q.push_back({l, r, i});
	}
	sort(Q, [](qy x, qy y) {
		const int B = 300;
		if(x.l / B != y.l / B) return x.l < y.l;
		return x.r < y.r;
	});

	int l = 0, r = 0;
	++ cnt[0][0];
	ll sum = 0;

	for(auto [L, R, id] : Q) {
		for(;r < R;) {
			sum += get(l, r, r + 1);
			++ r, ++ cnt[r & 1][pre[r]];
		}
		for(;l > L;) {
			sum += get(l, r, l - 1);
			-- l, ++ cnt[l & 1][pre[l]];
		}
		for(;r > R;) {
			-- cnt[r & 1][pre[r]];
			-- r;
			sum -= get(l, r, r + 1);
		}
		for(;l < L;) {
			-- cnt[l & 1][pre[l]];
			++ l;
			sum -= get(l, r, l - 1);
		}
		ans[id] = sum;
	}
	for(int i = 1;i <= q;++i) {
		cout << ans[i] << '\n';
	}

	return 0;
}