#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5, M = 15, P = 1e9 + 7, INF = 0X3F3F3F3F;
const unsigned long long D = 743, mo = 966335533, mo1 = 966331133;
int n, q;
long long now, ans, sum[N], fac[22];
std::vector<int> a;
void cantor(long long x, int y) {
  std::vector<int> v;
  a.clear();
  for (int i = 1; i <= y; i++) v.push_back(n - y + i);
  for (int i = y; i >= 1; i--) {
    long long r = x % fac[i - 1];
    long long t = x / fac[i - 1];
    x = r;
    sort(v.begin(), v.end());
    a.push_back(v[t]);
    v.erase(v.begin() + t);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  fac[0] = 1;
  for (int i = 1; i <= 15; i++) fac[i] = 1LL * fac[i - 1] * i;
  cin >> n >> q;
  if (n <= M) {
    cantor(0, n);
    for (int i = 1, op, l, r, x; i <= q; i++) {
      cin >> op;
      if (op == 1) {
        cin >> l >> r;
        ans = 0;
        for (int j = l - 1; j < r; j++) ans += a[j];
        cout << ans << '\n';
      } else {
        cin >> x;
        now += x;
        cantor(now, n);
      }
    }
  } else {
    cantor(0, M);
    for (int i = 1; i <= n - M; i++) {
      sum[i] = sum[i - 1] + i;
    }
    for (int i = 1, op, l, r, x; i <= q; i++) {
      cin >> op;
      if (op == 1) {
        cin >> l >> r;
        ans = 0;
        if (l <= n - M) ans += sum[min(n - M, r)] - sum[l - 1];
        for (int j = max(n - M + 1, l); j <= r; j++) ans += a[j - n + M - 1];
        cout << ans << '\n';
      } else {
        cin >> x;
        now += x;
        cantor(now, M);
      }
    }
  }
  return 0;
}
