def main():
    import sys

    def add(i, x):
        i += 1
        while i < n+1:
            table[i] += x
            i += i & -i

    def rank(x):
        idx = 0
        for lv in range(n.bit_length()-1, -1, -1):
            mid = idx+(1 << lv)
            if mid >= n+1: continue
            if table[mid] < x:
                x -= table[mid]
                idx += 1 << lv
        return idx

    n, q = list(map(int, sys.stdin.readline().split()))
    aa = list(map(int, sys.stdin.readline().split()))

    cs = [0]
    for a in aa: cs.append(cs[-1]+a)

    table = [0]*(n+1)
    for i in range(1, n): add(i, 1)

    lr = list(range(n))

    for _ in range(q):
        t, l, r = list(map(int, sys.stdin.readline().split()))
        l -= 1
        if t == 1:
            i = rank(l)
            for _ in range(r-l-1):
                j = lr[i]+1
                add(j, -1)
                k = lr[j]
                lr[k] = i
                lr[i] = k
        else:
            i = rank(l)
            j = rank(r)
            print(cs[j]-cs[i])

main()