#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

inline ll rd() {
	ll x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

inline ll lowbit(ll x) {return x & -x;}

const int N = 10000007;

ll c[N];

inline void add(int pos, ll val) {
	for (; pos < N; pos += lowbit(pos)) c[pos] += val;
}

inline ll sum(int pos) {
	ll ret = 0;
	for (; pos; pos -= lowbit(pos)) ret += c[pos];
	return ret;
}

inline ll sum(int L, int R) {
	return sum(R) - sum(L - 1);
}

int main() {
	vector<ll> s;
	vector<tuple<int, ll, ll>> q;
	ll n = rd(), m = rd();
	rep(i, 1, m) {
		int op = rd();
		ll l = rd(), r = rd();
		q.eb(op, l, r);
		if (op == 1) while (l <= n) {s.eb(l); l += lowbit(l);}
	}
	sort(all(s));
	s.erase(unique(all(s)), s.end());
	auto getv = [&](ll w) {
		return lower_bound(all(s), w) - s.begin() + 1;
	};
	for (auto [op, L, R] : q) {
		if (op == 1) {
			while (L <= n) {
				add(getv(L), R);
				L += lowbit(L);
			}
		} else printf("%lld\n", sum(getv(L), getv(R)));
	}

	return 0;
}