#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

template<typename T>
class SegmentTree {
    class Node {
    public:
        ll l, r;
        T data;
        Node* child_L;
        Node* child_R;
        Node(ll l, ll r, T data) {
            this->l = l;
            this->r = r;
            this->data = data;
            this->child_L = nullptr;
            this->child_R = nullptr;
        }
    };

    Node* root;
    ll N;
    const T init = 0;
    T op(const T& a, const T& b) {
        return a + b;
    }
public:
    SegmentTree(ll n) {
        this->N = n;
        this->root = new Node(0, n, init);
    }

    void update(Node* node, ll k, T a) {
        if (node->l <= k && k < node->r) {
            if (node->l == k && node->r == k+1) {
                node->data += a;
            } else {
                if (node->child_L == nullptr) {
                    ll mid = (node->l + node->r) / 2;
                    node->child_L = new Node(node->l, mid, init);
                    node->child_R = new Node(mid, node->r, init);
                }
                update(node->child_L, k, a);
                update(node->child_R, k, a);
                node->data = op(node->child_L->data, node->child_R->data);
            }
        }
    }
    
    void update(ll k, T a) {
        update(this->root, k, a);
    }

    T query(Node* node, ll l, ll r) {
        if (node == nullptr || node->r <= l || r <= node->l) return init;
        if (l <= node->l && node->r <= r) return node->data;
        return op(query(node->child_L, l, r), query(node->child_R, l, r));
    }
    
    T query(ll l, ll r) {
        return query(this->root, l, r);
    }
};

int n, q;
bool com[100010];
ll x[100010], y[100010];

void solve() {
    SegmentTree<ll> sgt(n+1);
    for (int i = 0; i < q; i++) {
        if (com[i]) {
            if (x[i] <= y[i]) cout << sgt.query(x[i], y[i]+1) << endl;
        } else {
            sgt.update(x[i], y[i]);
        }
    }
}

void input() {
    cin >> n >> q;
    for (int i = 0; i < q; i++) {
        cin >> com[i] >> x[i] >> y[i];
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    solve();
}

Measured memory_bytes: 12372