SP64 PERMUT1 - Permutations

Let A = \[a $ _{1} $ ,a $ _{2} $ ,...,a $ _{n} $ \] be a permutation of integers 1,2,...,n. A pair of indices (i,j), 1=0. What is the number of n-element permutations containing exactly k inversions? For instance, the number of 4-element permutations with exactly 1 inversion equals 3. ### Task Write a program which for each data set from a sequence of several data sets: - reads integers n and k from input, - computes the number of n-element permutations with exactly k inversions, - writes the result to output.

The first line of the input file contains one integer d, 1

The i-th line of the output file should contain one integer - the number of n-element permutations with exactly k inversions.