class SegmentTree

  def initialize xs, id, &block
    @id = id
    @block = block
    i = 1
    i *= 2 while i < xs.size
    @width = i
    @data = Array.new(2 * i - 1, id)
    @data[i-1...i-1+xs.size] = xs
    (i-2).downto(0) {|j| @data[j] = block[@data[2*j+1], @data[2*j+2]] }
  end

  def query i, j, k = 0, a = 0, b = @width
    return @data[k] if i == a && j == b
    c = (a + b) / 2
    case
    when j <= c
      query i, j, 2 * k + 1, a, c
    when c <= i
      query i, j, 2 * k + 2, c, b
    else
      @block[query(i, c, 2 * k + 1, a, c), query(c, j, 2 * k + 2, c, b)]
    end
  end

  def [] i
    @data[@width - 1 + i]
  end

  def []= i, x
    i = @width - 1 + i
    @data[i] = x
    while i > 0
      j = (i-1)/2
      @data[j] = @block[@data[2*j+1], @data[2*j+2]]
      i = j
    end
  end

end

n, q = gets.split.map(&:to_i)
st = SegmentTree.new(Array.new(n, 0), 0) {|a, b| a + b }
q.times do
  c, x, y = gets.split.map(&:to_i)
  if c.zero?
    st[x-1] += y
  else
    p st.query x - 1, y
  end
end