Problem:
Score : 100 points

Problem Statement

You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.

0 p x: a_p \gets a_p + x

1 l r: Print \sum_{i = l}^{r - 1}{a_i}.

Constraints

1 \leq N, Q \leq 500,000

0 \leq a_i, x \leq 10^9

0 \leq p < N

0 \leq l_i < r_i \leq N

All values in Input are integer.

Input

Input is given from Standard Input in the following format:

N Q
a_0 a_1 ... a_{N - 1}
\textrm{Query}_0
\textrm{Query}_1
:
\textrm{Query}_{Q - 1}

Output

For each query of the latter type, print the answer.

Sample Input 1

5 5
1 2 3 4 5
1 0 5
1 2 4
0 3 10
1 0 5
1 0 3

Sample Output 1

15
7
25
6

Solution in Ruby (2.7.1) (judge verdict: Accepted)

def get_i()
  return gets.chomp.split(" ").map(&:to_i)
end
#input of float(split by space)
def get_f()
  return gets.chomp.split(" ").map(&:to_f)
end
#input of string(split by space)
def get()
  return gets.chomp.split(" ")
end
#input of string(split per one character)
def get_nsp()
  return gets.chomp.split("")
end
#yes or no decision
def yn_judge(bool,y="Yes",n="No")
  return bool ? y : n 
end
#create of array
def array(size1,init=nil,size2=-1)
  if size2==-1
      return Array.new(size1){init}
  else
      return Array.new(size2){Array.new(size1){init}}
  end
end

def max(a,b)
    return a>b ? a : b
end

def min(a,b)
    return a>b ? b : a
end

INF=Float::INFINITY

#====BitIndexedTree====
class BitIndexedTree
    attr_accessor:bit,:n
    def initialize(n,init_array=nil)
      @n=n
      @bit=Array.new(@n+1){0}
      unless init_array.nil?
        @n.times do|i|
            add(i+1,init_array[i])
        end
      end
    end

    def add(i,x)
        while i<=@n
            @bit[i]+=x
            i+=i&-i
        end
    end

    def sum(i)
        ret_sum=0
        while i>0
          ret_sum+=@bit[i]
          i-=i&-i
        end
        return ret_sum
    end

    def get_sum(l,r)
        return sum(r)-sum(l-1)
    end
end


N,Q=get_i
A=get_i
bit=BitIndexedTree.new(N,A)
Q.times do|i|
    t,a,b=get_i
    a+=1
    if t.zero?
        bit.add(a,b)
    else
        puts bit.get_sum(a,b)
    end
end