RP - Life, the Universe, and Everything II

no tags 

This problem tests your mathematic knowledge and your programming ability very much. Your task is to calculate the number of different Minimum Spanning Trees (MSTs) of a special undirected unweighted graph. The graph has n nodes numbered from 1 to n, and there is an edge between node i (1<=i<=n) and node j (1<=j<=n) if and only if 0<|i-j|<=k.

Input

Multiple test cases, the number of them(<=8) is given in the very first line.

Each test case contains one line with two space-separated numbers k(1<=k<=5) and n(1<=n<=1015).

Output

For each test case you should output one line, the number of different MSTs of the corresponding graph modulo 65521.

Example

Input:
1
3 5

Output:
75

hide comments
Benjamin Jones: 2009-05-20 13:10:23

@Paul Draper
Yes! Just count unique spawn trees.
A spawn tree is unique iif its prufer code is unique.
(hey i'm hinting you)

Paul Draper: 2009-04-28 10:17:00

What trees are unique? Is 1-2-3 unique from 2-1-3?

Paul Draper: 2009-04-28 10:09:21

How does a minimum spanning tree and a general tree differ in an unweighted graph?


Added by:[Trichromatic] XilinX
Date:2007-08-04
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: C99 strict ERL JS
Resource:Chinese National Olympiad in Informatics 2007,Day 2; Translated by Blue Mary