n,m=map(int,input().strip().split())
matrix = [list(map(int, input().split())) for _ in range(n)]
def count_bfs():
directions=[(0,1),(0,-1),(1,0),(-1,0),(1,1),(-1,1),(-1,-1),(1,-1)]
result=[[0]*m for _ in range(n)]
for i in range(n):
for j in range(m):
if matrix[i][j]==1:
result[i][j]=9
else:
count=0
for dx,dy in directions:
nx=dx+i
ny=dy+j
if 0<=nx<n and 0<=ny<m and matrix[nx][ny]==1:
count+=1
result[i][j]=count
return result
result=count_bfs()
for i in range(n):#循环遍历输出
for j in range(m):
print(result[i][j],end=' ')
print()
