#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define rep(i, l, r) for (int i = (l), i##end = (r); i <= i##end; ++i)
#define per(i, l, r) for (int i = (l), i##end = (r); i >= i##end; --i)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define log(...) (void(0))
#define endl '\n'
#endif
using namespace std;
using ll = long long;
using lll = __int128;
using lf = long double;
using ull = unsigned long long;

const int N = 1e5 + 9;
int m;
ll n;
vector<ll> val, s;
vector<tuple<int, ll, ll>> q;

void add(int k, int x) {
  for (; k <= val.size(); k += k & -k) s[k] += x;
}
ll ask(int k) {
  ll res = 0;
  for (; k; k -= k & -k) res += s[k];
  return res;
}
int locate(ll x) {
  return lower_bound(all(val), x) - val.begin() + 1; //
}

int main() {
#ifdef memset0
  freopen("D.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> m;
  for (int op, i = 1; i <= m; i++) {
    ll x, y;
    cin >> op >> x >> y;
    q.emplace_back(op, x, y);
    if (op == 1) {
      for (lll k = x; k <= n; k += k & -k) {
        val.push_back((ll)k);
      }
    } else {
      val.push_back(x);
      val.push_back(y);
    }
  }
  sort(all(val));
  val.erase(unique(all(val)), val.end());
  s.resize(val.size() + 1);
  for (const auto &[op, x, y] : q) {
    if (op == 1) {
      for (lll k = x; k <= n; k += k & -k) {
        add(locate(k), y);
      }
    } else {
      cout << ask(locate(y)) - ask(locate(x) - 1) << endl;
    }
  }
}