#include <bits/stdc++.h>
using namespace std;
istream& inp = cin;
template <typename T>
vector<T> readV(int size) {
  vector<T> result;
  for (int i = 0; i < size; ++i) {
    T x;
    inp >> x;
    result.push_back(x);
  }
  return result;
}
template <typename T>
T divup(T a, T b) {
  if ((a % b) == 0) return a / b;
  return 1 + a / b;
}
const int64_t M = 5e+10;
vector<int64_t> fac{1};
int PSize = 0;
int64_t toFac(vector<int> p, int pos) {
  if (p.size() == pos) return 0;
  int64_t r = fac.at(p.size() - pos - 1) * p.at(pos) - 1;
  for (int i = pos + 1; i < p.size(); ++i)
    if (p.at(i) > p.at(pos)) --p.at(i);
  return r + toFac(p, pos + 1);
}
vector<int> fromFac(int64_t x) {
  vector<int> R(PSize);
  vector<bool> occ(PSize + 1, false);
  for (int i = 0; i < PSize; ++i) {
    int64_t u = x / fac.at(PSize - i - 1);
    int v = 1;
    while (occ.at(v)) ++v;
    for (int j = 0; j < u; ++j) {
      ++v;
      while (occ.at(v)) ++v;
    }
    R.at(i) = v;
    occ.at(v) = true;
    x = x % fac.at(PSize - i - 1);
  }
  return R;
}
void cv(vector<int> const& v) {
  for (int x : v) cout << x << " ";
  cout << endl;
}
int main() {
  assert(inp);
  int64_t f = 1;
  for (int64_t i = 1; f <= M * 100; ++i) {
    f *= i;
    fac.push_back(f);
  }
  PSize = 4;
  int n, q;
  inp >> n >> q;
  while (fac.at(PSize) <= M) ++PSize;
  PSize = min(PSize, n);
  const int64_t bound = n - PSize;
  int64_t perm = 0;
  for (int qn = 0; qn < q; ++qn) {
    int qt;
    inp >> qt;
    if (2 == qt) {
      int x;
      inp >> x;
      perm += x;
    } else {
      int64_t l, r;
      inp >> l >> r;
      --l;
      --r;
      auto end = fromFac(perm);
      int64_t sum = 0;
      if (l < bound) {
        const int64_t r0 = min(bound - 1, r) + 1;
        sum += r0 * (r0 + 1) / 2 - (l) * (l + 1) / 2;
        l = 0;
      } else
        l -= bound;
      r -= bound;
      if (r >= 0) {
        auto p = fromFac(perm);
        for (int i = l; i <= r; ++i) sum += p.at(i) + bound;
      }
      cout << sum << endl;
    }
  }
  return 0;
}
