祭录\

#include<cstdio>
#include<iostream>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<list>
#define ll long long
#define db long double
//#pragma GCC optimize(1)
//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
int n,m;
int a[110][110];
int b[110][110];
int main()
{
	ios::sync_with_stdio(false);
	std::cin.tie(0),std::cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cin>>a[i][j],b[i][j]=a[i][j];
//	cout<<endl;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			bool tf=true;
			int sum=a[i][j]+a[i-1][j]+a[i][j-1]+a[i][j+1]+a[i+1][j];
			if(i==1||i==n||j==1||j==m)
				tf=false;
			if(tf){
				b[i][j]=sum/5;
			}
			if(j==1)
				cout<<b[i][j];
			else
				cout<<" "<<b[i][j];
		}
		cout<<endl;
	}
	return 0;
}