def main0(n,q,a,tlr):
  pass

# 0-indexed binary indexed tree
class BIT:
  def __init__(self, n):
    self.n = n
    self.data = [0]*(n+1)
    self.el = [0]*(n+1)
  # sum of [0,i) sum(a[:i])
  def sum(self, i):
    if i==0:return 0
    s = 0
    while i > 0:
      s += self.data[i]
      i -= i & -i
    return s
  def add(self, i, x):
    i+=1
    self.el[i] += x
    while i <= self.n:
      self.data[i] += x
      i += i & -i
  # sum of [l,r)   sum(a[l:r])
  def sumlr(self, i, j):
    return self.sum(j) - self.sum(i)
  # a[i]
  def get(self,i):
    i+=1
    return self.el[i]

def main1(n,q,a,tlr):
  # 削除前と削除後のidxの紐づけを保持する。
  # f:i->j このとき必ずi>=j
  bit=BIT(n+1)
  sa=[0]
  for x in a:
    sa.append(sa[-1]+x)
  ret=[]
  for t,l,r in tlr:
    l,r=l-1,r-1
    if t==1:
      bit.add(l+1,r-l)
    else:
      ll=l+bit.sum(l+1)
      rr=r+bit.sum(r+1)
      ret.append(sa[rr+1]-sa[ll])
  return ret
    
if __name__=='__main__':
  n,q=map(int,input().split())
  a=list(map(int,input().split()))
  tlr=[list(map(int,input().split())) for _ in range(q)]
  ret1=main1(n,q,a,tlr)
  print(*ret1,sep="\n")