#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		std::cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

void solve() {
	int n, q;
	cin >> n >> q;
	using ft = atcoder::fenwick_tree<int>;
	vector<ft> vf(26, ft{n});
	rep(i, 0, n) {
		int a;
		cin >> a;
		rep(j, 0, 26) if ((a >> j) & 1) vf[j].add(i, 1);
	}
	rep(Qi, 0, q) {
		int l, r;
		cin >> l >> r;
		l--;
		ll ans = 0;
		rep(i, 0, 26) {
			int sm = vf[i].sum(l, r);
			ans += (1ll << i) * sm * (r - l - sm);
		}
		cout << ans << "\n";
	}
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}