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

struct fenwick {
    int n;
    vector<long long> fenw;

    fenwick() = default;
    fenwick(int n) : n(n), fenw(n, 0) {}

    void upd(int k, long long x) {
        for (; k < n; k |= k + 1) fenw[k] += x;
    }

    long long get(int k) {
        long long res = 0;
        for (; k >= 0; k &= k + 1, --k) res += fenw[k];
        return res;
    }

    long long get(int l, int r) {
        if (l > r) return 0;
        return get(r) - get(l - 1);
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    long long n;
    int m;
    cin >> n >> m;
    vector<long long> vals;
    vector<tuple<int, long long, long long>> qq(m);
    for (auto& [x, y, z] : qq) {
        cin >> x >> y >> z;
        if (x == 1) {
            long long a = y;
            while (a <= n) {
                vals.push_back(a);
                a += a & -a;
            }
        }
    }
    sort(vals.begin(), vals.end());
    vals.resize(unique(vals.begin(), vals.end()) - vals.begin());
    fenwick fenw(vals.size());
    for (auto [x, y, z] : qq) {
        if (x == 1)  {
            while (y <= n) {
                fenw.upd(lower_bound(vals.begin(), vals.end(), y) - vals.begin(), z);
                y += y & -y;
            }
        } else {
            int ql = lower_bound(vals.begin(), vals.end(), y) - vals.begin();
            int qr = upper_bound(vals.begin(), vals.end(), z) - vals.begin() - 1;
            cout << fenw.get(ql, qr) << '\n';
        }
    }
}