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. 


-----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.


-----Examples-----
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.

Difficulty: interview

Starter code:

Solutions:
N,k=map(int,input().split())

ind=0
for i in range(N):
    for j in range(N):
        if(j!=N-1):
            if(j==i):
                print(k,end=" ")
            else:
                print(0,end=" ")
        else:
            if(j==i):
                print(k)
            else:
                print(0)


n, k = map(int, input().split())
for i in range(n):
    for j in range(n):
        if i == j:
            print(k, end = ' ')
        else:
            print(0, end = ' ')
    print()

n,k = list(map(int,input().split()))
p = [ [0 for j in range(n)] for j in range(n)]
for i in range(n):
	p[i][i] = k
for i in range(n):
	print(*p[i])


n, k = map(int, input().split())
for i in range(n):
    if i != n-1:
        print(*([0]*(n-i-1)), end = ' ')
    print(k, end = ' ')
    print(*([0]*(i)))

n, k = list(map(int, input().split()))
A = [['0' for i in range(n)] for j in range(n)]
for i in range(n):
    A[i][i] = str(k)
for row in A:
    print(' '.join(row))


import math
line = input()

integers = [int(i) for i in line.split()]
n = integers[0]
k = integers[1]

for i in range(n):
    if(n - i - 2 != -1):
        print((str(0) + ' ')*i + str(k) + ' ' + (str(0) + ' ')*(n - i - 2) + str(0))
    else:
        print((str(0) + ' ')*i + str(k))


n, k = map(int, input().split())

for i in range(n):
	for j in range(n):
		if i == j:
			print(k, end=' ')
		else:
			print(0, end=' ')
	print('')


3

def readln(): return tuple(map(int, input().split()))

n, k = readln()
for i in range(n):
    print(*[k if i == j else 0 for j in range(n)])


n, k = map(int, input().split())
for i in range (n):
    for j in range (n):
        print([0,k][i==j],end=" ")
    print()


from copy import deepcopy
n, k = map(int, input().split())


def fill_matrix(n):
    data = []
    q = [0]*n
    for i in range(n):
        data.append(deepcopy(q))
    return data


def E_matrix(matrix):
    for i in range(n):
        matrix[i][i] = k


matrix = fill_matrix(n)


E_matrix(matrix)


for row in matrix:
        sep = ' '
        for col in row:
                print(col, end=sep)
        print('')



n, k = map(int, input().split())

for row in range(n):
        for col in range(n):
                if row == col:
                        print(k, end=' ')
                else:
                        print(0, end=' ')
        print()

n, k = [int(i) for i in input().split()]
a = [[0] * n for i in range(n)]
for i in range(n):
    a[i][i] = k
for i in a:
    print(*i)

n, k = map(int, input().split())
ans = [[0]*n for i in range(n)]
q = 0
for i in range(n):
    for j in range(n):
        if j == q:
            ans[i][j] = k
    q += 1
for i in range(n):
    print(*ans[i])

n,k = list(map(int,input().split()))
for i in range(n):
    out = ''
    for j in range(n):
        if i==j:
            out += str(k)+' '
        else:
            out += str(0)+' '
    print(out.rstrip())


n, k = [int(x) for x in input().split()]
for i in range(n):
	for j in range(n):
		if(j!=i):
			print('0', end=' ')
		else:
			print(str(k), end=' ')
	print('\n', end='')


n, k = map(int, input().split())

mat = [[0]*n for i in range(n)]

for i in range(n):
    mat[i][i] = k
for x in mat:
    print(*x)

n,k=map(int,input().split())
for i in range(n):
    for j in range(n):
        if(i==j): print(k,end=' ')
        else: print('0',end=' ')
    print('');


def genstring(num, length, index):
    return ('0 '*(index) + str(num) + ' ' + '0 ' * (length-index)).strip()
a, b = list(map(int, input().split(' ')))
for t in range(a):
    print(genstring(b, a-1, t))


import itertools
import math
import random

import time
def timer(f):
    def tmp(*args, **kwargs):
        t = time.time()
        res = f(*args, **kwargs)
        print("Время выполнения функции: %f" % (time.time()-t))
        return res

    return tmp

def genArray(length, lower, upper):
    return [random.randint(lower, upper) for i in range(length)]

#print(genArray(5, 4, 9))


n, k = list(map(int, input().split(' ')))
s = ""
for i in range(n):
    for j in range(n):
        if i==j:
            s+=str(k)+" "
        else:
            s+="0 "
    s+="\n"
print(s)