#include <bits/stdc++.h>
using namespace std;

#define For(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, n) For(i, 0, n)
#define rFor(i, a, b) for(int i = (a); i >= (b); i--)
#define ALL(v) (v).begin(), (v).end()
#define rALL(v) (v).rbegin(), (v).rend()
#define SZ(v) ((int)(v).size())

using lint = long long;
using ld = long double;

int INF = 2000000000;
lint LINF = 1000000000000000000;

struct SetupIo {
    SetupIo() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} setupio;

// a <- max(a, b)
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

// a <- min(a, b)
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
struct PrefixSum {
    int n;
    vector<T> s;
    
    PrefixSum() {}
    PrefixSum(vector<T> &a) : n(a.size()), s(n + 1, T(0)) {
        for (int i = 0; i < n; i++) {
            s[i + 1] = s[i] + a[i];
        }
    }
   
    // [l, r)
    T prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= n);
        return s[r] - s[l];
    }
};


int main() {
    int N, Q;
    cin >> N >> Q;
    vector<lint> A(N);
    rep(i, N) {
        cin >> A[i];
    }
    vector<vector<lint>> cnt(26, vector<lint>(N, 0));
    rep(i, N) {
        rep(b, 26) {
            if (A[i] & (1 << b)) {
                cnt[b][i]++;
            }
        }
    }
    vector<PrefixSum<lint>> sum(26);
    rep(i, 26) {
        sum[i] = PrefixSum<lint>(cnt[i]);
    }

    while (Q--) {
        int L, R;
        cin >> L >> R;
        L--;
        lint ans = 0;
        rep(i, 26) {
            lint x = sum[i].prod(L, R);
            lint y = R - L - x;
            ans += (1LL << i) * x * y;
        }
        cout << ans << "\n";
    }
}