#include <bits/stdc++.h>
using namespace std;
long long poww(long long a, long long b, long long md) {
  return (!b ? 1
             : (b & 1 ? a * poww(a * a % md, b / 2, md) % md
                      : poww(a * a % md, b / 2, md) % md));
}
const long long MAXN = 1e6 + 10;
const long long INF = 8e18;
const long long MOD = 1e9 + 7;
const long long FACT = 17;
long long fact[FACT], k = 1, q, n;
inline vector<int> perm_t(int n, long long k, long long L = 1) {
  vector<int> ans, dig;
  for (int i = 1; i <= n; i++) dig.push_back(L + i - 1);
  for (int i = 1; i <= n; i++) {
    long long red = fact[n - i];
    long long d = (k + red - 1) / red;
    k -= (d - 1) * red;
    auto it = dig.begin() + d - 1;
    ans.push_back(*it);
    dig.erase(it);
  }
  return ans;
}
inline long long sum(long long L, long long R) {
  return R * (R + 1) / 2 - L * (L - 1) / 2;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  fact[0] = fact[1] = 1;
  for (int i = 2; i < FACT; i++) fact[i] = fact[i - 1] * i;
  cin >> n >> q;
  while (q--) {
    int cmd;
    cin >> cmd;
    if (cmd == 1) {
      long long l, r;
      cin >> l >> r;
      if (n < FACT) {
        vector<int> P = perm_t(n, k);
        int ans = 0;
        for (int i = l - 1; i < r; i++) ans += P[i];
        cout << ans << '\n';
      } else {
        vector<int> P = perm_t(FACT, k, n - FACT + 1);
        long long ans = 0;
        if (l < n - FACT + 1) ans += sum(l, min(n - FACT, r));
        for (int i = max(n - FACT + 1, l); i <= r; i++)
          ans += P[i - (n - FACT + 1)];
        cout << ans << '\n';
      }
    } else {
      int x;
      cin >> x;
      k += x;
    }
  }
  return 0;
}
