from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
setrecursionlimit(2000000) # これこどふぉだと無理
#set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 10**16
#print("debug")
from collections import defaultdict,deque
from heapq import heappop,heappush


n,Q = mi()
a = li() 

pre = [[0]*(n+1) for _ in range(26)]

for i in range(n):
    for j in range(26):
        if (a[i] >> j) & 1:
            pre[j][i+1] += 1 

        pre[j][i+1] += pre[j][i]

for _ in range(Q):
    l,r = mi() 
    ans = 0 
    l -= 1 
    for i in range(26):
        d = r - l 
        x = pre[i][r] - pre[i][l]
        ans += (x*(d-x))<<i 
    
    print(ans)