#include <bits/stdc++.h>
using namespace std;
long long kth;
long long orig[200001];
long long psum[200001];
long long fact[21];
bool visited[21];
int remain[21];
int fixedNum[21];
int bound;
void initVisited() {
  for (int i = 0; i < 21; i++) visited[i] = 0;
}
void fixNum() {
  long long curK = kth;
  initVisited();
  for (int i = 1; i <= bound; i++) {
    int curPos = (curK / fact[(bound - i)]) + 1;
    int cnt = 0;
    for (int j = 1; j <= bound; j++) {
      if (!visited[j]) {
        cnt++;
        if (cnt == curPos) {
          visited[j] = true;
          fixedNum[i] = remain[j];
          break;
        }
      }
    }
    curK -= fact[(bound - i)] * ((long long)curPos - 1);
  }
}
long long getSum(long long b, long long e) { return psum[e] - psum[b - 1]; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  fact[0] = 1;
  for (int i = 1; i < 21; i++) fact[i] = fact[i - 1] * i;
  kth = 0;
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) orig[i] = i;
  for (int i = 1; i <= n; i++) psum[i] = psum[i - 1] + orig[i];
  bound = min(n, 20);
  for (int i = 1; i <= bound; i++) remain[i] = n - bound + i;
  for (int q = 0; q < k; q++) {
    int ty;
    cin >> ty;
    if (ty == 1) {
      int l, r;
      cin >> l >> r;
      fixNum();
      long long sum = getSum(l, r);
      int updateL = max(l, n - bound + 1);
      int updateR = min(r, n);
      long long diff = 0;
      for (int i = updateL; i <= updateR; i++) {
        diff += i - fixedNum[i - (n - bound)];
      }
      sum -= diff;
      cout << sum << '\n';
    } else if (ty == 2) {
      int step;
      cin >> step;
      kth += step;
    }
  }
}
