Levko and Table CodeForces - 361A(思维)

Levko and Table

CodeForces - 361A

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

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 andk (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 exceed1000 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.

思路：受题目样例的影响可能会去想怎么选取书让每一行加和凑出k来，但是实际上转化一下思维的话，让对角线等于k就可以了
code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
	int n,k;
	cin >> n >> k;
	int i,j;
	for(i = 1; i <= n; i++){
		for(j = 1; j <= n; j++){
			if(i == j) cout << k;
			else cout << "0";
			if(j != n) cout << " ";
			else cout << endl;
		}
	}
	return 0;
}