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

void solve()
{
  int n, q;
  cin >> n >> q;
  vector<vector<int>> v(n + 1, vector<int>(26, 0));
  for (int i = 0; i < n; i++)
  {
    int a;
    cin >> a;
    for (int j = 0; j < 26; j++)
    {
      v[i + 1][j] = v[i][j];
      if (((1 << j) & a) != 0)
        v[i + 1][j]++;
    }
  }
  for (int i = 0; i < q; i++)
  {
    int l, r;
    cin >> l >> r;
    ll ans = 0;
    for (int j = 0; j < 26; j++)
    {
      ll one = v[r][j] - v[l - 1][j];
      ll zero = r - l + 1 - one;
      ll base = (1LL << j);
      ans += one * zero * base;
    }
    cout << ans << "\n";
  }
}

int main()
{
  cin.tie(0)->sync_with_stdio(0);
  cout << fixed << setprecision(20);
  int CNT = 1;
  for (int i = 0; i < CNT; i++)
    solve();
}