用 python 写了一遍，为啥 TLE 了？

n, m = input().split()
n = int(n)
m = int(m)
d = [0] * (n + 10)
def lowbit(x):
    return x & (-x)
def modify(x, y):
    while x <= n:
        d[x] += y
        x = x + lowbit(x)
def query(x):
    ret = 0
    while x:
        ret += d[x]
        x = x - lowbit(x)
    return ret
str = input()
a = str.split()
for i in range(0, n):
    a[i] = int(a[i])
    modify(i+1, a[i])
for i in range(0, m):
    op, x, y = input().split()
    op = int(op)
    x = int(x)
    y = int(y)
    if op == 1:
        modify(x, y)
    else:
        print("%d\n"%(query(y) - query(x-1)), end="")