import sys, math
sys.setrecursionlimit(1000000)
INF = 1 << 100
mod = 1000000007
#mod = 998244353
input = lambda: sys.stdin.readline().rstrip()
li = lambda: list(map(int, input().split()))

def get_divisors(x: int) -> list:
    divisors = []
    for i in range(1, x+1):
        if i * i > x:
            break
        if x % i == 0:
            divisors.append(i)
            if x // i != i:
                divisors.append(x // i)
    return divisors

N, H = li()
W = N // H
flg = 0
if H > W:
    H, W = W, H
    flg = 1

divs = get_divisors(N)
divs = sorted(divs, reverse=1)[1:]
ans = [[0] * W for _ in range(H)]
idx = 0
rest = [i for i in divs]

for h in range(H):
    for w in range(W):
        ans[h][w] = divs[idx]
        rest[idx] -= 1
        if not rest[idx]:
            idx += 1

if flg:
    def rotate_clockwise(A):
        return list(zip(*(A[::-1])))
    ans = rotate_clockwise(ans)

for a in ans:
    print(*a)