#include <bits/stdc++.h>
using namespace std;
void pr(long long x, bool fl = false) {
  cout << x << endl;
  if (fl) exit(0);
}
void pr(long long x, long long y, bool fl = false) {
  cout << x << " " << y << endl;
  if (fl) exit(0);
}
const long long mod = 998244353;
const long long inf = LLONG_MAX;
const long long minf = LLONG_MIN;
const long long maxn = 200000;
const long long maxc = 26;
void chkmax(long long &_max, long long x) { _max = max(_max, x); }
void chkmin(long long &_min, long long x) { _min = min(_min, x); }
void modadd(long long &now, long long x, long long p = mod) {
  while (now < 0) now += p;
  x %= p;
  now %= p;
  now += x;
  now %= p;
  while (now < 0) now += p;
}
void modmul(long long &now, long long x, long long p = mod) {
  while (now < 0) now += p;
  x %= p;
  now %= p;
  now *= x;
  now %= p;
  while (now < 0) now += p;
}
long long qpow(long long a, long long b, long long p = mod) {
  long long ans = 1;
  a %= p;
  while (b) {
    if (b & 1) ans *= a;
    a *= a;
    ans %= p;
    a %= p;
    b /= 2;
  }
  return ans;
}
long long inv(long long a, long long p = mod) { return qpow(a % p, p - 2, p); }
long long c, xx, y, z, n, m, q, l, r, u, v, w, tmp, nxt, rt, cur, dis;
long long ans, val, flag;
long long a[maxn + 5], f[maxn + 5], x;
long long peng(long long x) {
  if (x <= 1) return 1;
  return peng(x - 1) * x;
}
void change() {
  for (long long i = 1; i <= y; i++) f[i] = i, a[i] = 0;
  long long j = 1, now = x;
  while (j <= y) {
    long long k = now / peng(y - j);
    now = now % peng(y - j);
    long long cnt = 0, nowj = 1;
    while (nowj <= y) {
      while (a[nowj] == 1) nowj++;
      cnt++;
      if (cnt > k) break;
      nowj++;
    }
    f[j] = nowj;
    a[nowj] = 1;
    j++;
  }
}
signed main() {
  ios::sync_with_stdio(false);
  long long test_case = 1;
  long long opt = 0;
  while (test_case--) {
    cin >> n >> q;
    y = min(n, 15ll);
    for (long long i = 1; i <= y; i++) f[i] = i;
    if (n <= 15) {
      for (long long i = 1; i <= q; i++) {
        cin >> opt;
        if (opt == 1) {
          ans = 0;
          change();
          cin >> l >> r;
          for (long long i = l; i <= r; i++) ans += f[i];
          pr(ans);
        } else
          cin >> z, x += z;
      }
    } else {
      for (long long i = 1; i <= q; i++) {
        cin >> opt;
        if (opt == 1) {
          ans = 0;
          cin >> l >> r;
          if (r >= n - 14) {
            change();
            for (long long i = max(1ll, l - n + 15); i <= r - n + 15; i++)
              ans += n - 15 + f[i];
            r = n - 15;
          }
          if (l <= r) ans += (l + r) * (r - l + 1) / 2;
          pr(ans);
        } else {
          cin >> z;
          x += z;
        }
      }
    }
  }
}
