#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=1005;
int n,m;
int ans[N][N],b[N],a[N];
int c[N][N];
map<int,int>f[N];
int dl;
void dfs(int k,int sm)
{
    if (f[k].count(sm)) return;

    if (k==n)
    {
        if (sm!=0&&(n==m||sm%(n-m)!=0)) return;

        int o=0;
        if (sm!=0) o=sm/(n-m);
        for (int i=0;i<m;i++) a[i]-=o;
        for (int i=0;i<n;i++) b[i]-=o;

        for (int i=1;i<m;i++) ans[0][i]=a[i],b[0]-=a[i];
        for (int i=0;i<n;i++)
        {
            ans[i][0]=b[i];
        }
        for (int i=0;i<n;i++)
        {
            for (int j=0;j<m;j++) cout<<ans[i][j]<<" ";
            cout<<'\n';
        }
        fflush(stdout);
        exit(0);
    }
    for (int i=-m*dl;i<=m*dl;i++)
    {
        b[k]=i;
        bool bl=1;
        for (int j=0;j<m;j++)
        {
            if (abs(b[k]-a[j])!=c[k][j])
            {
                bl=0;
                break;
            }
        }
        if (bl) dfs(k+1,sm+i);
    }
    f[k][sm]=1;
}
mt19937_64 rnd(time(0));
void BellaKira()
{
    cin>>n>>m;
    for (int i=0;i<n;i++)
        for (int j=0;j<m;j++)
            cin>>c[i][j],dl=max(dl,c[i][j]);
    while (1)
    {
        for (int i=0;i<m;i++)
        {
            a[i]=c[0][i];
            if (rnd()%2) a[i]=-a[i];
        }
        int sm=0;
        for (int i=0;i<m;i++) sm-=a[i];
        dfs(1,sm);
        for (int i=1;i<n;i++) f[i].clear();
    }
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}