#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;
using ll = long long;

int main() {
    int n, q;
    cin >> n >> q;
    
    vector<int> a(n);
    rep(i, n) cin >> a[i];
    
    int m = 26;
    vector s(m, vector<int>(n+1));
    rep(k, m)rep(i, n) {
        s[k][i+1] = s[k][i] + (a[i]>>k&1);
    }
    
    rep(qi, q) {
        int l, r;
        cin >> l >> r;
        --l;
        
        ll ans = 0;
        int w = r-l;
        rep(k, m) {
            int c1 = s[k][r] - s[k][l];
            int c0 = w-c1;
            ans += 1ll*c0*c1<<k;
        }
        cout << ans << '\n';
    }
    
    return 0;
}