#include <bits/stdc++.h>
using namespace std;
const int mxN = 2e5 + 5;
int n, q, a[mxN];
long long fct[mxN];
void get_perm(long long x) {
  for (int i = max(0, n - 14); i < n; i++) {
    a[i] = i + 1;
  }
  for (int i = max(0, n - 14); i < n - 1; i++) {
    while (x >= fct[n - i - 1]) {
      if (x == 0) return;
      int ch = n + 1;
      for (int j = i + 1; j < n; j++) {
        if (ch > a[j] && a[j] > a[i]) {
          ch = a[j];
        }
      }
      vector<int> vct;
      for (int j = i; j < n; j++) {
        if (a[j] != ch) vct.push_back(a[j]);
      }
      sort(vct.begin(), vct.end());
      a[i] = ch;
      int k = 0;
      for (int j = i + 1; j < n; j++) {
        a[j] = vct[k++];
      }
      x -= fct[n - i - 1];
    }
  }
}
void solve() {
  for (int i = 0; i < n; i++) {
    a[i] = i + 1;
  }
  fct[0] = 1;
  for (int i = 1; i <= n + 2; i++) {
    fct[i] = fct[i - 1] * i;
    if (fct[i] >= 1LL * mxN * mxN) break;
  }
  long long t, l, r;
  long long perm = 0;
  while (q--) {
    cin >> t;
    if (t == 1) {
      cin >> l >> r;
      l--;
      r--;
      get_perm(perm);
      long long right_border = max(0, n - 14);
      long long sm = 0;
      if (n < 14) {
        for (int i = l; i <= r; i++) {
          sm += a[i];
        }
      } else {
        for (int i = max(right_border, l); i <= r; i++) {
          sm += a[i];
        }
        r = min(r, right_border - 1);
        if (l <= n - 14) {
          sm += 1LL * (l + r + 2) * (r - l + 1) / 2;
        }
      }
      cout << sm << "\n";
    } else {
      cin >> l;
      perm += l;
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> q;
  solve();
  return 0;
}
