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.

The single line contains two integers, $ n $ and $ k $ ( $ 1

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.

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.