#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<long long>a(n);
	rep(i, n)cin >> a[i];
	vector<int>l(q), r(q);
	rep(i, q) {
		cin >> l[i] >> r[i];
		l[i]--;
	}
	vector cum(26, vector<int>(n + 1));
	rep(i, 26) {
		rep(j, n) {
			cum[i][j + 1] = cum[i][j];
			if (1 & (a[j] >> i))cum[i][j + 1]++;
		}
	}
	rep(i, q) {
		long long ans = 0;
		int sz = r[i] - l[i];
		rep(j, 26) {
			int p = cum[j][r[i]] - cum[j][l[i]];
			int n = sz - p;
			ans += (1LL << j) * p * n;
		}
		cout << ans << endl;
	}
	return 0;
}