/*
	corgi.java
	by Charles

	Demo fewnick tree code.

	27 March 2019
*/

import java.util.*;
import java.io.*;

public class corgi {

	public corgi(FastScanner in) {
		int n = in.nextInt(), m = in.nextInt();

		fenwick wick = new fenwick(n);

		while (m --> 0) {
			int type = in.nextInt();
			if (type == 1) {
				int i = in.nextInt(), c = in.nextInt();
				wick.add(i, c);
			} else {
				int l = in.nextInt(), r = in.nextInt();
				System.out.println( (wick.sum(r) - wick.sum(l-1)) );
			}
		}
	}

	public static void main(String [] args) {
		new corgi(new FastScanner());
	}
}

class fenwick {
	int n; long[] bit;
	public fenwick(int _n) { bit = new long[(n = _n) + 1]; }
	void add(int i, long v) { for (; i <= n; i += (i & -i)) bit[i] += v; }
	long sum(int h) { long ret = 0; for (; h != 0; h -= (h & -h)) ret += bit[h]; return ret; }
}

class FastScanner {
	BufferedReader br;
	StringTokenizer st;

	public FastScanner() {
		br = new BufferedReader(new InputStreamReader(System.in));
		st = new StringTokenizer("");
	}

	String next() {
		if(!st.hasMoreElements()) {
			try { st = new StringTokenizer(br.readLine()); }
			catch (Exception e) {}
		}
		return st.nextToken();
	}

	int nextInt()  {
		return Integer.parseInt(next());
	}
}