Levko and Table(思维)

Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautifulto 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.

Input

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

Output

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.

Example

Input

2 4

Output

1 3
3 1

Input

4 7

Output

2 1 0 4
4 0 2 1
1 3 3 0
0 3 2 2

Note

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.

题意：给你n和k，建立一个n*n的矩阵，使这个矩每一行，每一列的和都等于k。

分析：由于只需要输出一组，所以直接让k在矩阵对角线上，其他位置全都为0即可。

例如第二例子可输出：

7 0 0 0

0 7 0 0

0 0 7 0

0 0 0 7

#include<stdio.h>
int main()
{
    int n,k;
    int i,j;

    scanf("%d%d",&n,&k);
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(i==j)
                printf("%d",k);
            else
                printf("0");
            if(j<n-1)
                printf(" ");
        }
        printf("\n");
    }
    return 0;
}