#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9+9;



void solve() {
 ll n,k;
 cin>>n>>k;
 vector<ll>v;
 ll bit0[n+1][31],bit1[n+1][31];
 for(ll i=0;i<n;i++){
    ll a;
    cin>>a;
    v.push_back(a);

 }
 
 for(ll j=0;j<31;j++){
    bit0[0][j]=0;
    bit1[0][j]=0;
 }
 
 for(ll i=0;i<n;i++){
    for(ll j=0;j<29;j++){
        if(v[i]&(1<<j)){
            bit1[i+1][j]=bit1[i][j]+1;
            bit0[i+1][j]=bit0[i][j];
        }
        else{
            bit0[i+1][j]=bit0[i][j]+1; 
            bit1[i+1][j]=bit1[i][j];
        }
    }
 }
 
 for(ll k=0;k<n;k++){
    ll l,r;
    cin>>l>>r;
    ll ans=0;
    for(ll i=0;i<29;i++){
        ans+=(bit0[r][i]-bit0[l-1][i])*(bit1[r][i]-bit1[l-1][i])*(1<<i);
    }
    cout<<ans<<endl;
 }
 
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t=1;
    //cin>>t;
    while(t--) {
        solve();   
    }
    return 0;
}