#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N = 2e6 + 10;
map<int, int> tree;
int n;
int lowbit(int x)
{
    return x & -x;
}
void add(int pos, int val)
{
    int sum1 = 0;
    while (pos <= n)
    {
        sum1 += val;
        tree[pos] += sum1;
        pos += lowbit(pos);
    }
}
int query(int x)
{
    int ans = 0;
    while (x >= 1)
    {
        ans = ans + tree[x];
        x = x - lowbit(x);
    }
    return ans;
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int m;
    cin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int id, x, y;
        cin >> id >> x >> y;
        if (id == 1)
        {
            add(x, y);
        }
        else
        {
            cout << query(y) - query(x - 1) << '\n';
        }
    }
}