#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll c2(ll a) {
	return ((a * (a-1))/2);
}
int main() {
	int N, Q;cin >> N >> Q;
	int K = 60;
	vector<ll> A(N+1, 0);
	vector<vector<ll>> C(N+1, vector<ll>(K, 0));
	for (int i = 1;i <= N;i++) {
		cin >> A[i];
		for (int j = 0;j < K;j++) {
			C[i][j] = C[i-1][j];
			if ((1LL <<j) & A[i]) C[i][j]++;
		}
	}
	while (Q--) {
		ll ret = 0;
		int L, R;cin >> L >> R;
		for (int d = 0;d < K;d++) {
			ll cnt = c2((ll)(R-L+1));
			ll ones = C[R][d] - C[L-1][d];
			ll zeros = (ll)(R-L+1) - ones;
			cnt -= c2(ones) + c2(zeros);
			ret += (1LL<<d) * cnt;
		}
		cout << ret << endl;
	}
}