#include <bits/stdc++.h>
using namespace std;
const long long dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const long long dxx[8] = {-1, -1, 0, 1, 1, 1, 0, -1},
                dyy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long mod = 1000000007;
const long long base = 311;
const long long N = 2e5 + 5;
long long n, q, a[N];
long long fact[20], f[N];
void gogo() {
  cin >> n >> q;
  long long cur = 0;
  fact[0] = 1;
  for (long long i = 1; i <= 15; ++i) fact[i] = fact[i - 1] * i;
  for (long long i = 1; i <= n; ++i) {
    f[i] = f[i - 1] + i;
  }
  while (q--) {
    long long t;
    cin >> t;
    if (t == 1) {
      long long l, r;
      cin >> l >> r;
      cout << f[r] - f[l - 1] << '\n';
    } else {
      long long x;
      cin >> x;
      cur += x;
      long long beg = max(1ll, n - 14);
      for (long long i = beg; i <= n; ++i) f[i] = 0;
      vector<long long> p;
      for (long long i = beg; i <= n; ++i) p.push_back(i);
      vector<long long> np;
      long long tmp = cur;
      while (tmp) {
        for (long long i = ((long long)(p).size()) - 1; i >= 0; --i) {
          if (i * fact[((long long)(p).size()) - 1] <= tmp) {
            tmp -= i * fact[((long long)(p).size()) - 1];
            np.push_back(p[i]);
            p.erase(p.begin() + i);
            break;
          }
          if (i == 0) {
            np.push_back(p[0]);
            p.erase(p.begin());
          }
        }
      }
      for (long long i : p) np.push_back(i);
      for (long long i = beg; i <= n; ++i) {
        a[i] = np[i - beg];
        f[i] = f[i - 1] + a[i];
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  if (fopen("sol"
            ".inp",
            "r")) {
    freopen(
        "sol"
        ".inp",
        "r", stdin);
    freopen(
        "sol"
        ".out",
        "w", stdout);
  }
  gogo();
}
