cf——签（神tm浪的一匹）

A - 签

  CodeForces - 361A 

想了好久，没思路，怪我最近太浪了，还是我拿不动刀了....................

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.

#include<stdio.h>
using namespace std;
int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			if(i==j)
			printf("%d",k);
			else
			printf("0");
			if(j!=n)
			printf(" ");
			else
			printf("\n");
		}
		return 0;
}