t = int(input())
for _ in range(t):
n,m = map(int,input().split())
arr=[]
for i in range(n):
arr.append(list(map(int,input().split())))
for rI in range(n):
for cI in range(m):
item=arr[rI][cI]
if rI == 0:
up=0
else:
up=arr[rI-1][cI]
if rI == n-1:
down=0
else:
down=arr[rI+1][cI]
if cI == 0:
left=0
else:
left=arr[rI][cI-1]
if cI == m-1:
right=0
else:
right= arr[rI][cI+1]
if up < item and down < item and left < item and right < item :
arr[rI][cI]=max(up , down , left, right)
for row in arr:
for num in row:
print(num,end=" ")
print()
1343C - Alternating Subsequence | 1325A - EhAb AnD gCd |
746A - Compote | 318A - Even Odds |
550B - Preparing Olympiad | 939B - Hamster Farm |
732A - Buy a Shovel | 1220C - Substring Game in the Lesson |
452A - Eevee | 1647B - Madoka and the Elegant Gift |
1408A - Circle Coloring | 766B - Mahmoud and a Triangle |
1618C - Paint the Array | 469A - I Wanna Be the Guy |
1294A - Collecting Coins | 1227A - Math Problem |
349A - Cinema Line | 47A - Triangular numbers |
1516B - AGAGA XOOORRR | 1515A - Phoenix and Gold |
1515B - Phoenix and Puzzle | 155A - I_love_username |
49A - Sleuth | 1541A - Pretty Permutations |
1632C - Strange Test | 673A - Bear and Game |
276A - Lunch Rush | 1205A - Almost Equal |
1020B - Badge | 1353A - Most Unstable Array |