#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <random>
#include <ctime>
#include <chrono>
#include <numeric>
#include <iomanip>
#include <cassert>

typedef long long ll;
typedef double lf;
typedef unsigned long long ull;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1010, MAXM = 2e6 + 10;

int n, m;
ll c[MAXN][MAXN], ans[MAXN][MAXN];

bool Tr;
inline void Swap()
{
    Tr = 1;
    int mx = max(n, m);
    for (int i = 1; i <= mx; i++)
        for (int j = 1; j < i; j++)
            swap(c[i][j], c[j][i]);
    swap(n, m);
}
inline void Print()
{
    if (Tr)
    {
        for (int i = 1; i <= m; i++, cout << "\n")
            for (int j = 1; j <= n; j++)
                cout << ans[j][i] << ' ';
        return;
    }
    for (int i = 1; i <= n; i++, cout << '\n')
        for (int j = 1; j <= m; j++)
            cout << ans[i][j] << ' ';
}

ll a[MAXN], b[MAXN];
inline void Trans()
{
    if (n == 1)
    {
        for (int i = 1; i <= m; i++) ans[1][i] = b[i];
        return;
    }
    if (m == 1)
    {
        for (int i = 1; i <= n; i++) ans[i][1] = a[i];
        return;
    }
    ll sum0 = 0, sum1 = 0;
    for (int i = 2; i < n; i++) ans[i][1] = a[i], sum0 += a[i];
    for (int i = 2; i < m; i++) ans[1][i] = b[i], sum1 += b[i];
    ans[1][m] = a[1] - sum1, ans[n][1] = b[1] - sum0, ans[n][m] = b[m] - ans[1][m];
}
vector <pair <int, int>> op;
bitset <MAXM> f[MAXN];
inline bool Solve(int p, int q)
{
    int t = abs(n - m), sum = 0;
    for (int i = 1; i <= m; i++) b[i] = -c[p][i], sum -= b[i];
    op.clear(), a[p] = 0;
    for (int i = 1; i <= n; i++)
    {
        if (i == p) continue;
        int lx = b[q] - c[i][q], rx = b[q] + c[i][q];
        bool fl = (lx <= 0), fr = (rx <= 0);
        for (int j = 1; j <= m; j++)
            fl &= (abs(lx - b[j]) == c[i][j]), fr &= (abs(rx - b[j]) == c[i][j]);
        if (!fl && !fr) return 0;
        if (!fr) a[i] = lx;
        else if (!fl) a[i] = rx;
        else a[i] = lx, op.emplace_back(rx - lx, i);
        sum += a[i];
    }
    int tot = op.size();
    f[0].reset(), f[0].set(0);
    for (int i = 1; i <= tot; i++) f[i] = f[i - 1], f[i] |= (f[i - 1] << op[i - 1].first);
    int x;
    if (!t) x = -sum;
    else
    {
        for (x = (-sum % t + t) % t; x < MAXM; x += t)
            if (f[tot][x]) break;
        if (x >= MAXM) x = -1;
    }
    if (x < 0 || !f[tot][x]) return 0;
    for (int i = tot; i >= 1; i--)
        if (!f[i - 1][x]) a[op[i].second] += op[i].first, x -= op[i].first;
    if (n != m)
    {
        int sum0 = accumulate(a + 1, a + n + 1, 0), sum1 = accumulate(b + 1, b + m + 1, 0);
        int tt = (sum0 - sum1) / (m - n);
        for (int i = 1; i <= n; i++) a[i] += tt;
        for (int i = 1; i <= m; i++) b[i] += tt;
    }
    return Trans(), 1;
}

int main()
{
    // freopen("D.in", "r", stdin);
    // freopen("D.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m);
    int p = -1, q = -1, mx = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
        {
            Read(c[i][j]);
            if (mx < c[i][j]) mx = c[i][j], p = i, q = j;
        }
    if (Solve(p, q)) Print();
    else Swap(), Solve(q, p), Print();
    return 0;
}