#include <bits/stdc++.h>
using namespace std;
using namespace std;
inline int read() {
  char ch;
  bool sign = 0;
  int res = 0;
  while (!isdigit(ch = getchar()))
    if (ch == '-') sign = 1;
  while (isdigit(ch)) res = res * 10 + (ch ^ 48), ch = getchar();
  if (sign)
    return -res;
  else
    return res;
}
const int maxn = 200000 + 10;
const long long inf = 2e18;
const int maxm = 200;
const long long mod = 998244353;
int maxlen = 14;
long long fac[maxm];
int n, q;
inline long long query(long long Rank, int l, int r) {
  if (r <= n - maxlen) {
    return 1LL * (l + r) * (r - l + 1) / 2;
  }
  long long ans = 0;
  vector<int> p = vector<int>(maxlen, -1);
  vector<int> vis = vector<int>(maxlen, 0);
  for (int i = 0; i < maxlen; ++i) {
    for (int j = 0; j < maxlen; ++j) {
      if (vis[j]) continue;
      if (Rank > fac[maxlen - i - 1]) {
        Rank -= fac[maxlen - i - 1];
      } else {
        p[i] = j;
        vis[j] = 1;
        break;
      }
    }
  }
  for (auto i = (0); i < (maxlen); ++i)
    assert(p[i] >= 0), p[i] += n - maxlen + 1;
  if (l <= n - maxlen) ans += 1LL * (l + n - maxlen) * (n - maxlen - l + 1) / 2;
  for (auto i = (max(l - 1, n - maxlen)); i < (r); ++i)
    ans += p[i - (n - maxlen)];
  return ans;
}
inline void solve() {
  long long Rank = 1;
  for (auto o = (1); o <= (q); ++o) {
    int t, l, r;
    scanf("%d", &(t));
    scanf("%d", &(l));
    if (t == 1)
      scanf("%d", &(r)), printf("%lld\n", query(Rank, l, r));
    else
      Rank += l;
  }
}
int main(void) {
  fac[0]++;
  for (auto i = (1); i <= (15); ++i) fac[i] = fac[i - 1] * i;
  scanf("%d%d", &n, &q);
  maxlen = min(n, maxlen);
  solve();
  return 0;
}
