(n,q),a,*e=[[*map(int,s.split())]for s in open(0)]
bt=[[0]for _ in range(26)]
for t in range(26):
  for i in a:
    bt[t]+=bt[t][-1]+(i>>t&1),
def Add(k):
  global res
  # for j in range(L,R+1):
  for t in range(26):
    nt=bt[t][R+1]-bt[t][L]
    if a[k]>>t&1:
      res+=(R-L+1-nt)*(1<<t)
    else:
      res+=nt*(1<<t)
def Del(k):
  global res
  # for j in range(L,R+1):
  for t in range(26):
    nt=bt[t][R+1]-bt[t][L]
    if a[k]>>t&1:
      res-=(R-L+1-nt)*(1<<t)
    else:
      res-=nt*(1<<t)
N=2*10**5+10 
#M=Sqrt(Q)個のバケットを作る
M=int(q**0.5)+1
bucket=[[] for i in range(M)]
#lを基準にして各バケットにqueを振り分け
for i,(l,r)in enumerate(e):
  l-=1;r-=1
  bucket[l*M//n]+=(l,r,i),
#各バケットをrの降順/昇順にソート
for i in range(M):
  if i&1:
    bucket[i].sort(key=lambda x:-x[1])
  else:
    bucket[i].sort(key=lambda x:x[1])
ans=[0]*q
L=R=res=0
Add(0)
for b in bucket:
  for l,r,i in b:
    while R<r:R+=1;Add(R)
    while L>l:L-=1;Add(L)
    while R>r:Del(R);R-=1
    while L<l:Del(L);L+=1
    ans[i]=res
print(*ans,sep='\n')