#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7, inf = 0x3f3f3f3f, mod = 1e9 + 7;
long long fac[20], a[maxn], t[maxn];
int lowbit(int x) { return x & (-x); }
void add(int x, int v) {
  while (x < maxn) {
    t[x] += v;
    x += lowbit(x);
  }
}
long long ask(int x) {
  long long res = 0;
  while (x) {
    res += t[x];
    x -= lowbit(x);
  }
  return res;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  fac[0] = 1;
  for (int i = 1; i <= 15; ++i) fac[i] = fac[i - 1] * i;
  int n, q;
  cin >> n >> q;
  vector<int> st;
  int flag = inf;
  for (int i = 1; i <= n; ++i) {
    a[i] = i;
    add(i, i);
    if (n - i + 1 <= 15) {
      flag = min(i, flag);
      st.push_back(i);
    }
  }
  long long now = 0;
  int op, l, r, x;
  int c = 0;
  while (q--) {
    cin >> op;
    if (op == 1) {
      cin >> l >> r;
      cout << ask(r) - ask(l - 1) << '\n';
      c++;
    } else {
      cin >> x;
      now += x;
      vector<int> tmp = st;
      int sz = tmp.size();
      vector<bool> vis(sz, 0);
      long long cur = now;
      for (int i = flag; i <= n; ++i) {
        int kth = cur / fac[n - i], cnt = 0;
        if (i == n) assert(cur == 0);
        cur %= fac[n - i];
        for (int j = 0; j < sz; ++j) {
          if (vis[j]) continue;
          if (cnt == kth) {
            add(i, -a[i]);
            a[i] = tmp[j];
            add(i, a[i]);
            vis[j] = 1;
            break;
          }
          cnt++;
        }
      }
    }
  }
  return 0;
}
