import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

D = {6:3,28:7,496:31,8128:127}
K = {6:1,28:2,496:4,8128:6}

N,H = mi()
p = D[N]
k = K[N]

D = [1<<i for i in range(k+1)] + [p<<i for i in range(k+1)]
use = []
for i in range(k+1):
    use += [1<<i] * (1<<i)
for i in range(k+1):
    use += [p<<i] * (p<<i)
use = use[::-1]

if H%p==0:
    res = [[-1]*(N//H) for i in range(H)]
    for j in range(N//H):
        for i in range(H):
            res[i][j] = use.pop()
else:
    res = [[-1]*(N//H) for i in range(H)]
    for i in range(H):
        for j in range(N//H):
            res[i][j] = use.pop()

for i in range(H):
    print(*res[i])