#include <bits/stdc++.h>
using namespace std;
const int N=1e4+5; 
int n,m,a[N][N],b[N][N];
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>a[i][j];
		}
	} 
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			if(i==1 || i==n || j==1 || j==m)
			{
				b[i][j]=a[i][j];
			}
			else
			{
				b[i][j]=round((a[i-1][j]+a[i+1][j]+a[i][j+1]+a[i][j-1]+a[i][j])/5.0);
			}
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cout<<b[i][j]<<" ";
		}
		cout<<"\n";
	} 
	return 0; 
} 

#include<iostream> #include<cmath> using namespace std; const int N = 1e3 + 10; int a[N][N]; int b[N][N]; int n,m; int main () { cin >> n >> m; for(int i = 1; i <= n; i++) { for( int j = 1; j <= m ; j++) { cin >> a[i][j]; } } for(int i = 1;i <= n; i++) { for(int j = 1;j <= m; j++) { if(i1||in||j1||jm) { b[i][j]=a[i][j]; } else { b[i][j]=round((a[i][j]+a[i+1][j]+a[i-1][j]+a[i][j+1]+a[i][j-1])/5.0); } cout << b[i][j] << " "; } cout <<endl; }

return 0;

}

#include
using namespace std;
int a[1001][1001];
double b[1001][1001];
int main()
{
int i,j,n,m;
scanf("%d%d",&n,&m);
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
{
scanf("%d",&a[i][j]);
b[i][j]=a[i][j];
}
for(i=2;i<=n-1;++i)
for(j=2;j<=m-1;++j)
b[i][j]=round(a[i-1][j]+a[i][j-1]+a[i+1][j]+a[i][j+1]+a[i][j])/5.0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;++j) printf("%.0lf ",b[i][j]);
printf("\n");
}
return 0;
}