class SegmentTree:

    ele = 0



    def func(self, a, b):

        return a + b



    # SEG木は1-index

    # Aに関しては0-index



    def __init__(self, n):  # Aは0-idx

        self.n = n

        self.num = 2 ** ((self.n - 1).bit_length())

        self.SEG = [self.ele] * (2 * self.num)



    def search(self, idx):

        return self.SEG[idx + self.num]



    def initialize(self, A):

        for i in range(self.n):

            self.SEG[i + self.num] = A[i]

        for i in range(self.num - 1, 0, -1):

            self.SEG[i] = self.func(self.SEG[2 * i], self.SEG[2 * i + 1])



    def update(self, idx, val):

        idx += self.num

        self.SEG[idx] += val

        idx //= 2

        while idx:

            self.SEG[idx] = self.func(self.SEG[2 * idx], self.SEG[2 * idx + 1])

            idx //= 2



    def query(self, left, right):

        # 開区間

        resleft = self.ele

        resright = self.ele

        left += self.num

        right += self.num

        while right - left > 0:

            if left % 2 == 1:

                resleft = self.func(resleft, self.SEG[left])

                left += 1

            if right % 2 == 1:

                right -= 1

                resright = self.func(resright, self.SEG[right])

            left //= 2

            right //= 2

        return self.func(resleft, resright)





n, q = list(map(int, input().split()))

A = list(map(int, input().split()))



ST = SegmentTree(n)

ST.initialize(A)

for _ in range(q):

    s, a, b = list(map(int, input().split()))

    if s:

        print((ST.query(a, b)))

    else:

        ST.update(a, b)

import sys



input = sys.stdin.buffer.readline





class SegmentTree:

    ele = 0



    def func(self, a, b):

        return a + b



    # SEG木は1-index

    # Aに関しては0-index



    def __init__(self, n):  # Aは0-idx

        self.n = n

        self.num = 2 ** ((self.n - 1).bit_length())

        self.SEG = [self.ele] * (2 * self.num)



    def search(self, idx):

        return self.SEG[idx + self.num]



    def initialize(self, A):

        for i in range(self.n):

            self.SEG[i + self.num] = A[i]

        for i in range(self.num - 1, 0, -1):

            self.SEG[i] = self.func(self.SEG[2 * i], self.SEG[2 * i + 1])



    def update(self, idx, val):

        idx += self.num

        self.SEG[idx] += val

        idx //= 2

        while idx:

            self.SEG[idx] = self.func(self.SEG[2 * idx], self.SEG[2 * idx + 1])

            idx //= 2



    def query(self, left, right):

        # 開区間

        resleft = self.ele

        resright = self.ele

        left += self.num

        right += self.num

        while right - left > 0:

            if left % 2 == 1:

                resleft = self.func(resleft, self.SEG[left])

                left += 1

            if right % 2 == 1:

                right -= 1

                resright = self.func(resright, self.SEG[right])

            left //= 2

            right //= 2

        return self.func(resleft, resright)





n, q = list(map(int, input().split()))

ST = SegmentTree(n)

ST.initialize(list(map(int, input().split())))

for _ in range(q):

    s, a, b = list(map(int, input().split()))

    if s:

        print((ST.query(a, b)))

    else:

        ST.update(a, b)

class SegmentTree:
    ele = 0

    def func(self, a, b):
        return a + b

    # SEG木は1-index
    # Aに関しては0-index
    def __init__(self, n):  # Aは0-idx
        self.n = n
        self.num = 2 ** ((self.n - 1).bit_length())
        self.SEG = [self.ele] * (2 * self.num)

    def search(self, idx):
        return self.SEG[idx + self.num]

    def initialize(self, A):
        for i in range(self.n):
            self.SEG[i + self.num] = A[i]
        for i in range(self.num - 1, 0, -1):
            self.SEG[i] = self.func(self.SEG[2 * i], self.SEG[2 * i + 1])

    def update(self, idx, val):
        idx += self.num
        self.SEG[idx] += val
        idx //= 2
        while idx:
            self.SEG[idx] = self.func(self.SEG[2 * idx], self.SEG[2 * idx + 1])
            idx //= 2

    def query(self, left, right):
        # 開区間
        resleft = self.ele
        resright = self.ele
        left += self.num
        right += self.num
        while right - left > 0:
            if left % 2 == 1:
                resleft = self.func(resleft, self.SEG[left])
                left += 1
            if right % 2 == 1:
                right -= 1
                resright = self.func(resright, self.SEG[right])
            left //= 2
            right //= 2
        return self.func(resleft, resright)


n, q = list(map(int, input().split()))
A = list(map(int, input().split()))
ST = SegmentTree(n)
ST.initialize(A)
for _ in range(q):
    s, a, b = list(map(int, input().split()))
    if s:
        print((ST.query(a, b)))
    else:
        ST.update(a, b)

import sys

input = sys.stdin.buffer.readline


class SegmentTree:
    ele = 0

    def func(self, a, b):
        return a + b

    # SEG木は1-index
    # Aに関しては0-index
    def __init__(self, n):  # Aは0-idx
        self.n = n
        self.num = 2 ** ((self.n - 1).bit_length())
        self.SEG = [self.ele] * (2 * self.num)

    def search(self, idx):
        return self.SEG[idx + self.num]

    def initialize(self, A):
        for i in range(self.n):
            self.SEG[i + self.num] = A[i]
        for i in range(self.num - 1, 0, -1):
            self.SEG[i] = self.func(self.SEG[2 * i], self.SEG[2 * i + 1])

    def update(self, idx, val):
        idx += self.num
        self.SEG[idx] += val
        idx //= 2
        while idx:
            self.SEG[idx] = self.func(self.SEG[2 * idx], self.SEG[2 * idx + 1])
            idx //= 2

    def query(self, left, right):
        # 開区間
        resleft = self.ele
        resright = self.ele
        left += self.num
        right += self.num
        while right - left > 0:
            if left % 2 == 1:
                resleft = self.func(resleft, self.SEG[left])
                left += 1
            if right % 2 == 1:
                right -= 1
                resright = self.func(resright, self.SEG[right])
            left //= 2
            right //= 2
        return self.func(resleft, resright)


n, q = list(map(int, input().split()))
ST = SegmentTree(n)
ST.initialize(list(map(int, input().split())))
for _ in range(q):
    s, a, b = list(map(int, input().split()))
    if s:
        print((ST.query(a, b)))
    else:
        ST.update(a, b)

+import sys + +input = sys.stdin.buffer.readline + + -A = list(map(int, input().split())) -ST.initialize(A) +ST.initialize(list(map(int, input().split())))