#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
ll op(ll a, ll b){
    return a+b;
}
ll e(){return 0;}


int main(){
    int n, Q; cin >> n >> Q;
    vvll a(26, vll(n));
    rep(i, n){
        int b; cin >> b;
        bitset<26> bs(b);
        rep(j, 26)a[j][i] = bs[j];
    }

    vector<segtree<ll, op, e>> vseg;
    rep(i, 26){
        segtree<ll, op, e> seg(a[i]);
        vseg.push_back(seg);
    }
    
    while(Q--){
        int l, r; cin >> l >> r;
        l--;
        ll ans = 0, base = 1;
        rep(i, 26){
            ll cnt1 = vseg[i].prod(l, r);
            ll cnt0 = (r-l) - cnt1;
            ll tmp = cnt1*cnt0;
            ans += base*tmp;
            base*=2;
        }
        cout << ans << endl;
    }

    return 0;
}