#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  int n, q;
  cin >> n >> q;
  int m = 26;
  vector<vector<int>> s(m, vector<int>(n+1));
  rep(j,0,n) {
    int a;
    cin >> a;
    rep(i,0,m) {
      s[i][j+1] = s[i][j] + ((a >> i) & 1);
    }
  }
  while(q--) {
    int l, r;
    cin >> l >> r;
    --l;
    ll ans = 0;
    rep(i,0,m) {
      int c = s[i][r]-s[i][l];
      ans += (1LL<<i)*c*(r-l-c);
    }
    cout << ans << endl;
  }
  return 0;
}