#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
const int N=1000;
using namespace std;
int a[N][N],b[N][N];
int main()
{
int n,m,i,j;
scanf("%d %d",&n,&m);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&a[i][j]);
b[i][j]=a[i][j];
}
}
for(i=0;i<n;i++){
for(j=0;j<m;j++){
if(b[i][j]==b[i-1][j]&&b[i][j]==b[i+1][j]){
a[i][j]=a[i-1][j]=a[i+1][j]=0;
}
if(b[i][j]==b[i][j-1]&&b[i][j]==b[i][j+1]){
a[i][j]=a[i][j-1]=a[i][j+1]=0;
}
}
}
for(i=0;i<n;i++){
for(j=0;j<m;j++){
printf("%d ",a[i][j]);
}
printf("\n");
}
return 0;
}