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