#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MAX_N = 1e7;

ll N;
int M;
struct SegmentNode{
    int ls, rs;
    ll sum;
}node[MAX_N];
int rt, tot;

void segment_modify(int &i, ll l, ll r, ll x, int v) {
    i = i ? i : ++ tot;
    node[i].sum += v;
    if (l == r) return ;
    ll mid = l + r >> 1;
    mid < x ? segment_modify(node[i].rs, mid + 1, r, x, v) : segment_modify(node[i].ls, l, mid, x, v);
}

ll segment_query(int i, ll l, ll r, ll ql, ll qr) {
    if (!i) return 0;
    if (l < ql || r > qr) {
        ll sum = 0;
        ll mid = l + r >> 1;
        if (ql <= mid) sum = segment_query(node[i].ls, l, mid, ql, qr);
        if (mid < qr) sum += segment_query(node[i].rs, mid + 1, r, ql, qr);
        return sum;
    }else {
        return node[i].sum;
    }
}

int main() {
    scanf("%lld%d", &N, &M);
    for (int i = 1; i <= M; i ++) {
        int op;
        scanf("%d", &op);
        if (op == 1) {
            ll x; int v;
            scanf("%lld%d", &x, &v);
            for (ll j = x; j <= N; j += j & -j) segment_modify(rt, 1, N, j, v);
        }else {
            ll l, r;
            scanf("%lld%lld", &l, &r);
            printf("%lld\n", segment_query(rt, 1, N, l, r));
        }
    }
    return 0;
}