import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

# def ok(i, j):
#     cnt = 0
#     for di, dj in dij:
#         ni, nj = i+di, j+dj
#         if ni < 0 or nj < 0 or ni >= h or nj >= w: continue
#         cnt += t[i][j] == t[ni][nj]
#     return (t[i][j] == cnt)*1
#
# def dfs(i, j):
#     if j == w: i, j = i+1, 0
#     if i == h: return True
#     mx = (i > 0)+(j > 0)+(i < h-1)+(j < w-1)
#     for a in range(mx+1):
#         t[i][j] = a
#         isok = 1
#         if i: isok &= ok(i-1, j)
#         if i == h-1 and j: isok &= ok(i, j-1)
#         if i == h-1 and j == w-1: isok &= ok(i, j)
#         if isok and dfs(i,j+1):return True
#     return False
#
# h, w = LI()
# t = [[0]*w for _ in range(h)]
# pDB(dfs(0, 0))
# p2D(t)

t=[[0,1,1]*35,[1,2,2]*35,[1,2,2]*35]

def solve():
    h,w=LI()
    si=sj=0
    if h%3==2:si=1
    if w%3==2:sj=1
    for i in range(si,si+h):
        print(*t[i%3][sj:sj+w])

for _ in range(II()):solve()