Description:

The i^{th} row consists of M_{i,1}, M_{i,2}, M_{i,3}, M_{i,4} and M_{i,5}.

The jth column consists of M_{1,j }, M_{2,j} , M_{3,j} , M_{4,j} and M_{5,j} .

The main diagonal line consists of M_{1,1}, M_{2,2}, M_{3,3}, M_{4,4} and M5_{,5}.

The sub diagonal line consists of M_{1,5}, M_{2,4}, M_{3,3}, M_{4,2 }and M_{5,1}.

However, Mr.Frog will go to Hong Kong today. He asks you for help.

Input:

The first line contains an integer T, where T is the number of test cases. T test cases follow.

For each test case, the only line contains two integers N and K.

1<=T<=10

1<=N<=10^{3}

-10^{9}<=K<=10^{9}

Output:

For each test case, output one line containing “Case #x:”, where x is the test case number (starting from

1). If there is no solution, print “IMPOSSIBLE” in the next line; otherwise, print N lines with N integers.

If there are many multiple optimal answers, output any one of them.

Sample Input:

2 5 -7 3 373248

Sample Output:

Case #1: IMPOSSIBLE Case #2: 36 108 96 192 72 27 54 48 144

Submit