CF361A.Levko and Table

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

The single line contains two integers, $n$ and $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.

输入输出样例

输入#1
```
2 4
```
输出#1
```
1 3
3 1
```
输入#2
```
4 7
```
输出#2
```
2 1 0 4
4 0 2 1
1 3 3 0
0 3 2 2
```

说明/提示

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.

首页