CF361A.Levko and Table

Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k.

Unfortunately, he doesn't know any such table. Your task is to help him to find at least one of them.

列夫科非常喜爱由 $n$ 行和 $n$ 列组成的表格。他尤其钟爱“优美”的表格。当一个表格的每一行和每一列的元素之和均等于 $k$ 时，该表格对列夫科而言就是优美的。

不幸的是，他并不知道任何这样的表格。你的任务是帮助他找到至少一个满足条件的表格。

The single line contains two integers, n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 1000).

单行包含两个整数 $n$ 和 $k$（$1 ≤ n ≤ 100$，$1 ≤ k ≤ 1000$）。

Print any beautiful table. Levko doesn't like too big numbers, so all elements of the table mustn't exceed 1000 in their absolute value.

If there are multiple suitable tables, you are allowed to print any of them.

输出任意一个优美的表格。Levko 不喜欢过大的数字，因此表格中所有元素的绝对值均不得超过 1000。

如果存在多个符合条件的表格，则输出其中任意一个即可。

In the first sample the sum in the first row is 1 + 3 = 4, in the second row — 3 + 1 = 4, in the first column — 1 + 3 = 4 and in the second column — 3 + 1 = 4. There are other beautiful tables for this sample.

In the second sample the sum of elements in each row and each column equals 7. Besides, there are other tables that meet the statement requirements.

在第一个样例中，第一行的和为 $1 + 3 = 4$，第二行为 $3 + 1 = 4$，第一列为 $1 + 3 = 4$，第二列为 $3 + 1 = 4$。对于该样例，还存在其他优美的表格。

在第二个样例中，每行和每列的元素之和均为 $7$。此外，还存在其他满足题目要求的表格。