import sys
input = sys.stdin.readline
N, Q = map(int, input().split())
a = list(map(int, input().split()))
cs = [0] * (N + 1)
for i in range(N): cs[i + 1] = cs[i] + a[i]

class BIT:
  def __init__(self, n):
    self.n = n
    self.data = [0] * (n + 1)
    self.el = [0] * (n + 1)
  def sum(self, i):
    s = 0
    while i > 0:
      s += self.data[i]
      i -= i & -i
    return s
  def add(self, i, x):
    self.el[i] += x
    while i <= self.n:
      self.data[i] += x
      i += i & -i
  def get(self, i, j = None):
    if j is None:
      return self.el[i]
    return self.sum(j) - self.sum(i)
  def lowerbound(self, s):
    x = 0
    y = 0
    for i in range(self.n.bit_length(), -1, -1):
      k = x + (1 << i)
      if k <= self.n and (y + self.data[k] < s):
        y += self.data[k]
        x += 1 << i
    return x + 1

fwk = BIT(N)
for i in range(1, N + 1): fwk.add(i, 1)

for _ in range(Q):
  t, l, r = map(int, input().split())
  if t == 1:
    for i in range(r, l, -1):
      j = fwk.lowerbound(i)
      fwk.add(j, -1)

  if t == 2:
    i = fwk.lowerbound(l)
    j = fwk.lowerbound(r)
    print(cs[j] - cs[i - 1])