SP8442 NOVICE43 - Problem 3

When I first learned backtracking I made a program to find all the permutations of the English alphabets in lexicographically increasing. Filled with elation I showed the program to Rohil. Rohil being someone who likes to do stuff off the league was not impressed and gave me the following variation of the problem help me to solve the problem:

Line 1: T(no. of test cases) Line 2: n1 Line 3: n2 … …

Line 1: no. of such permutations of length n1 …… …..