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

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N, Q;
    cin >> N >> Q;
    
    vector sum(26, vector<int>(N));
    rep(i, 0, N) {
        int A;
        cin >> A;
        rep(j, 0, 26) if ((A >> j) & 1) sum[j][i] = 1;
    }
    
    rep(j, 0, 26) rep(i, 1, N) sum[j][i] += sum[j][i - 1];
    
    rep(query, 0, Q) {
        int L, R;
        cin >> L >> R;
        --L, --R;
        
        ll ans = 0;
        rep(j, 0, 26) {
            ll t;
            if (L == 0) t = sum[j][R];
            else t = sum[j][R] - sum[j][L - 1];
            
            ans += (1ll << j) * t * (R - L + 1 - t);
        }
        cout << ans << '\n';
    }
}