#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define sz(c) ((ll)(c).size())
#define ALL(x) x.begin(),x.end()
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define BS(A,x) binary_search(ALL(A),x)
#define rep(i,a,b) for(int i=a;i<b;i++)
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
using vi = vector<int>; 
using vvi = vector<vi>; 
using vl =vector<ll>;
using vvl=vector<vl>;
const long long mod=998244353;
//using mint = modint998244353;
int main() { 
	int n,q;cin>>n>>q;
	vl A(n);
	rep(i,0,n)cin>>A[i];
	vl ans(q);
	vl L(q),R(q);
	rep(i,0,q){cin>>L[i]>>R[i];L[i]--;}
	rep(i,0,30){
		fenwick_tree<ll>bit(n);
		rep(j,0,n){
			if((A[j]>>i)%2)bit.add(j,1);
		}
		rep(j,0,q){
		ans[j]+=(1LL<<i)*bit.sum(L[j],R[j])*(R[j]-L[j]-bit.sum(L[j],R[j]));
		}
	}
	rep(i,0,q)cout<<ans[i]<<endl;
}