human
A permutation is a sequence of integers from 1 to n of length n containing each number exactly once. For example, [1], [4, 3, 5, 1, 2], [3, 2, 1] — are permutations, and [1, 1], [4, 3, 1], [2, 3, 4] — no.

Permutation a is lexicographically smaller than permutation b (they have the same length n), if in the first index i in which they differ, a[i] < b[i]. For example, the permutation [1, 3, 2, 4] is lexicographically smaller than the permutation [1, 3, 4, 2], because the first two elements are equal, and the third element in the first permutation is smaller than in the second.

The next permutation for a permutation a of length n — is the lexicographically smallest permutation b of length n that lexicographically larger than a. For example: 

  * for permutation [2, 1, 4, 3] the next permutation is [2, 3, 1, 4].

  * for permutation [1, 2, 3] the next permutation is [1, 3, 2].

  * for permutation [2, 1] next permutation does not exist. 


You are given the number n — the length of the initial permutation. The initial permutation has the form a = [1, 2, …, n]. In other words, a[i] = i (1 ≤ i ≤ n).

You need to process q queries of two types: 

  * 1 l r: query for the sum of all elements on the segment [l, r]. More formally, you need to find a[l] + a[l + 1] + … + a[r]. 
  * 2 x: x times replace the current permutation with the next permutation. For example, if x=2 and the current permutation has the form [1, 3, 4, 2], then we should perform such a chain of replacements [1, 3, 4, 2] → [1, 4, 2, 3] → [1, 4, 3, 2]. 


For each query of the 1-st type output the required sum.

Input

The first line contains two integers n (2 ≤ n ≤ 2 ⋅ 10^5) and q (1 ≤ q ≤ 2 ⋅ 10^5), where n — the length of the initial permutation, and q — the number of queries.

The next q lines contain a single query of the 1-st or 2-nd type. The 1-st type query consists of three integers 1, l and r (1 ≤ l ≤ r ≤ n), the 2-nd type query consists of two integers 2 and x (1 ≤ x ≤ 10^5).

It is guaranteed that all requests of the 2-nd type are...
#   A
Give me a Python code to find a[l] + a[l + 1] + … + a[r]?
assistant
#Here is Python code to find a[l] + a[l + 1] + … + a[r].
uthor: yumtam
#   Created at: 2020-11-06 14:56

from __future__ import division, print_function
_interactive = False

def main():
    fact = [1]
    for i in range(1, 14+1):
        fact.append(fact[-1] * i)

    def rotate(p, i):
        return [p[i]] + p[:i] + p[i+1:]

    def perm(p, x):
        p = p[:]
        for i in range(14, 0, -1):
            if x >= fact[i]:
                times, x = divmod(x, fact[i])
                p[-i-1:] = rotate(p[-i-1:], times)
        return p

    n, q = input_as_list()
    cur = 0
    prefix_last = max(n-13, 1)
    suffix_base = list(range(prefix_last, n+1))
    suffix = suffix_base

    def f(x):
        if x <= prefix_last:
            res = x*(x-1)//2
        else:
            suffix_len = x-prefix_last
            res = prefix_last*(prefix_last-1)//2
            res += sum(suffix[:suffix_len])
        return res

    for _ in range(q):
        line = input_as_list()
        if line[0] == 1:
            l, r = line[1], line[2]
            print(f(r+1) - f(l))
        else:
            adv = line[1]
            cur += adv
            suffix = perm(suffix_base, cur)

# Constants
INF = float('inf')
MOD = 10**9+7

# Python3 equivalent names
import os, sys, itertools
if sys.version_info[0] < 3:
    input = raw_input
    range = xrange

    filter = itertools.ifilter
    map = itertools.imap
    zip = itertools.izip

# print-flush in interactive problems
if _interactive:
    flush = sys.stdout.flush
    def printf(*args, **kwargs):
        print(*args, **kwargs)
        flush()

# Debug print, only works on local machine
LOCAL = "LOCAL_" in os.environ
debug_print = (print) if LOCAL else (lambda *x, **y: None)

# Fast IO
if (not LOCAL) and (not _interactive):
    from io import BytesIO
    from atexit import register
    sys.stdin = BytesIO(os.read(0, os.fstat(0).st_size))
    sys.stdout = BytesIO()
    register(lambda: os.write(1, sys.stdout.getvalue()))
    input = lambda: sys.stdin.readline().rstrip('\r\n')

# Some utility functions(Input, N-dimensional lists,...