//include
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;

//typedef
//------------------------------------------
using LL = int64_t;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using PLL = pair<LL, LL>;

//container util
//------------------------------------------
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
#define rwhole(f,x,...) ([&](decltype((x)) whole) { return (f)(rbegin(whole), rend(whole), ## __VA_ARGS__); })(x)
#define EACH(i,c) for(decltype((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) whole(sort, c)
#define RSORT(c) rwhole(sort, c)

//constant
//--------------------------------------------
constexpr double EPS = 1e-10;
constexpr double PI  = M_PI;
constexpr int MOD = 1000000007;

// grid
//--------------------------------------------
VL dx = {0, 1, 0, -1};
VL dy = {1, 0, -1, 0};
VL dx2 = {-1, 0, 1, -1, 1, -1, 0, 1};
VL dy2 = {-1, -1, -1, 0, 0, 1, 1, 1};

//debug
//--------------------------------------------
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

//IO accelerate
//--------------------------------------------
struct InitIO {
	InitIO() {
		cin.tie(nullptr);
		ios_base::sync_with_stdio(false);
		cout << fixed << setprecision(30);
	}
} init_io;

//template
//--------------------------------------------
// declaretion
template<typename T> istream& operator >>(istream& is, vector<T>& vec);
template<typename T1, typename T2> ostream& operator <<(ostream& os, const pair<T1, T2>& p);
template<typename T> ostream& operator <<(ostream& os, const vector<T>& vec);
template<typename T> ostream& operator <<(ostream& os, const vector<vector<T>>& vv);
template<typename T> vector<T> make_v(size_t a);
template<typename T,typename... Ts> auto make_v(size_t a,Ts... ts);
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v);
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v);

// implementation
template<typename T>
istream& operator >>(istream& is, vector<T>& vec) {
	for(T& x: vec) is >> x;
	return is;
}
template<typename T1, typename T2>
ostream& operator <<(ostream& os, const pair<T1, T2>& p) {
	os << p.first << "," << p.second;
	return os;
}
template<typename T>
ostream& operator <<(ostream& os, const vector<T>& vec) {
	for(int i=0; i<vec.size(); i++){
		os << vec[i] << ( i+1 == vec.size() ? "" : "\t" );
	}
	return os;
}
template<typename T>
ostream& operator <<(ostream& s, const vector<vector<T>>& vv) {
	for (int i = 0; i < vv.size(); ++i) {
		s << vv[i] << endl;
	}
	return s;
}

// 多重vector
// auto dp=make_v<int>(4,h,w) みたいに使える
template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
	return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// 多重vectorのためのfill
// fill_v(dp,0) みたいに使える
template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
	for(auto &e:t) fill_v(e,v);
}

template<class T,class U> void chmax(T&a,U b){if(a<b)a=b;}
template<class T,class U> void chmin(T&a,U b){if(b<a)a=b;}
template<typename T> T gcd(T a, T b) { return b?gcd(b,a%b):a;}
template<typename T> T lcm(T a, T b) { return a/gcd(a,b)*b;}

//main code
template <class T>
class SegTree {
	int n;
	vector<T> data;
	T def;
	function<T(T,T)> operation;
	function<T(T,T)> update;

	// ノードk=[l,r)に着目
	T _query(int a, int b, int k, int l, int r) {
		if (r <= a or b <= l) return def; // 交差しない
		if (a <= l and r <= b) return data[k]; // a,l,r,bの順で完全に含まれる
		else {
			T c1 = _query(a, b, 2*k+1, l, (l+r)/2); // 左の子
			T c2 = _query(a, b, 2*k+2, (l+r)/2, r); // 左の子
			return operation(c1, c2);
		}
	}

	public:
	// _n:必要サイズ，_def:初期値かつ単位元，_operation:クエリ関数，_update:更新関数
	SegTree(size_t _n, T _def, function<T(T, T)> _operation, function<T(T,T)> _update)
		: def(_def), operation(_operation), update(_update) {
			n = 1;
			while (n < _n) {
				n *= 2;
			}
			data = vector<T>(2*n-1, def);
		}
	SegTree(vector<T>& v, T _def, function<T(T, T)> _operation, function<T(T,T)> _update)
		: def(_def), operation(_operation), update(_update) {
			n = 1;
			int _n = v.size();
			while (n < _n) {
				n *= 2;
			}
			data = vector<T>(2*n-1, def);
			for (int i = 0; i < v.size(); i++) {
				data[i+n-1] = v[i];
			}
			for (int i = n-2; i >= 0; i--) {
				data[i] = operation(data[i*2+1], data[i*2+2]);
			}
		}

	// 場所i(0-indexed)の値をxで更新
	void change(int i, T x) {
		i += n-1;
		data[i] = update(data[i], x);
		while (i > 0) {
			i = (i-1)/2;
			data[i] = operation(data[i*2+1], data[i*2+2]);
		}
	}

	// [a,b)の区間クエリを実行
	T query(int a, int b) {
		return _query(a,b,0,0,n);
	}

	// 添字でアクセス
	T operator[](int i) {
		return data[i+n-1];
	}

	friend ostream& operator<<(ostream& os ,const SegTree<T>& sg) {
		return os << sg.data;
	}
};

int main(int argc, char *argv[])
{
	LL n,q;
	cin >> n >> q;
	VL a(n,0);
	SegTree<LL> sg(a, 0, [](int a, int b){return a+b;}, [](int a, int b){return a+b;});
	for (int i = 0; i < q; i++) {
		int b,c,d;
		cin >> b >> c >> d;
		if (b==0) {
			sg.change(c-1, d);
		} else {
			cout << sg.query(c-1, d) << '\n';
		}
	}
	return 0;
}


Measured memory_bytes: 5672