#include <bits/stdc++.h>

// #define int int64_t

const int kMaxN = 1e3 + 5, kMod = 1e9 + 7, kInv2 = (kMod + 1) / 2;

int n, m;
int c[kMaxN][kMaxN], mat[kMaxN][kMaxN];

constexpr int qpow(int bs, int64_t idx = kMod - 2) {
  int ret = 1;
  for (; idx; idx >>= 1, bs = (int64_t)bs * bs % kMod)
    if (idx & 1)
      ret = (int64_t)ret * bs % kMod;
  return ret;
}

inline int add(int x, int y) { return (x + y >= kMod ? x + y - kMod : x + y); }
inline int sub(int x, int y) { return (x >= y ? x - y : x - y + kMod); }
inline void inc(int &x, int y) { (x += y) >= kMod ? x -= kMod : x; }
inline void dec(int &x, int y) { (x -= y) < 0 ? x += kMod : x; }

void print() {
  static int a[kMaxN] = {0}, b[kMaxN] = {0};
  std::fill_n(a + 1, n, 0);
  std::fill_n(b + 1, m, 0);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      a[i] += mat[i][j], b[j] += mat[i][j];
    }
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      assert(abs(a[i] - b[j]) == c[i][j]);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j)
      std::cout << mat[i][j] << ' ';
    std::cout << '\n';
  }
  exit(0);
}

void solve(int *a, int *b) {
  int suma = 0, sumb = 0;
  for (int i = 1; i <= n; ++i) suma += a[i];
  for (int i = 1; i <= m; ++i) sumb += b[i];
  if (n == m && suma != sumb) return;
  if (n != m) {
    if (suma % abs(n - m) != sumb % abs(n - m)) return;
    int det = (suma - sumb) / (m - n);
    for (int i = 1; i <= n; ++i) a[i] += det;
    for (int i = 1; i <= m; ++i) b[i] += det;
  }
  suma = 0, sumb = 0;
  for (int i = 1; i <= n; ++i) suma += a[i];
  for (int i = 1; i <= m; ++i) sumb += b[i];
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      assert(abs(a[i] - b[j]) == c[i][j]);
  assert(suma == sumb);
  for (int i = 1; i <= n - 1; ++i) {
    mat[i][1] = a[i];
  }
  for (int i = 1; i <= m; ++i) {
    mat[n][i] = b[i];
    for (int j = 1; j < n; ++j) mat[n][i] -= mat[j][i];
  }
  print();
  assert(suma == sumb);
}

void solvea(int x, int op) {
  static int a[kMaxN], b[kMaxN];
  std::fill_n(a + 1, n, 0);
  std::fill_n(b + 1, m, 0);
  a[x] = 0;
  for (int i = 1; i <= m; ++i) {
    if (!op) b[i] = a[x] + c[x][i];
    else b[i] = a[x] - c[x][i];
  }
  int mx = std::max_element(b + 1, b + 1 + m) - b, mi = std::min_element(b + 1, b + 1 + m) - b;
  std::cerr << b[mx] << ' ' << b[mi] << '\n';
  if (b[mx] == b[mi]) {
    int d = abs(n - m);
    for (int i = 1; i <= n; ++i) {
      if (c[i][mx] != c[i][mi]) return;
    }
    if (d) {
      static bool f[kMaxN][kMaxN];
      static int g[kMaxN][kMaxN];
      memset(f, 0, sizeof(f));
      f[0][0] = 1;
      for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < d; ++j) {
          if (!f[i - 1][j]) continue;
          if (i == x) {
            f[i][(j + a[i] % d + d) % d] = 1;
            g[i][(j + a[i] % d + d) % d] = a[i];
          } else {
            int a1 = b[mx] - c[i][mx], a2 = b[mx] + c[i][mx];
            f[i][(j + a1 % d + d) % d] = 1;
            g[i][(j + a1 % d + d) % d] = a1;
            f[i][(j + a2 % d + d) % d] = 1;
            g[i][(j + a2 % d + d) % d] = a2;
          }
        }
      }
      int sum = 0;
      for (int i = 1; i <= m; ++i) sum += b[i];
      for (int r = sum % d; r <= sum % d; ++r) {
        if (f[n][r]) {
          for (int i = n; i; --i) {
            a[i] = g[i][r];
            r = (r - a[i] % d + d) % d;
          }
          break;
        }
      }
    } else {
      static int f[kMaxN * kMaxN];
      int sum = 0;
      for (int i = 1; i <= n; ++i) sum += c[i][mx];
      // std::cerr << "!!! " << sum << '\n';
      if (sum & 1) return;
      memset(f, 0, sizeof(f));
      sum /= 2;
      f[0] = 1;
      int tmp = 0;
      for (int i = 1; i <= n; ++i) {
        tmp += c[i][mx];
        for (int j = tmp; j >= c[i][mx]; --j)
          inc(f[j], f[j - c[i][mx]]);
      }
      if (!f[sum]) return;
      std::vector<int> vec;
      int now = sum;
      static bool vis[kMaxN];
      memset(vis, 0, sizeof(vis));
      for (int i = 1; i <= n; ++i) {
        if (!c[i][mx]) {
          for (int j = c[i][mx]; j <= now; ++j)
            f[j] = 1ll * f[j] * kInv2 % kMod;
        } else {
          for (int j = c[i][mx]; j <= now; ++j)
            dec(f[j], f[j - c[i][mx]]);
        }
        if (now >= c[i][mx] && f[now - c[i][mx]]) {
          vis[i] = 1, now -= c[i][mx];
        }
      }
      assert(!now);
      for (int i = 1; i <= n; ++i) {
        int o = (op == 0 ? -1 : 1);
        if (vis[i] != vis[x]) o = -o;
        a[i] = b[mx] + o * c[i][mx];
      }
    }
  } else {
    for (int i = 1; i <= n; ++i) {
      if (i == x) continue;
      if (abs(b[mi] - (b[mx] - c[i][mx])) == c[i][mi]) a[i] = b[mx] - c[i][mx];
      else a[i] = b[mx] + c[i][mx];
    }
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      if (abs(a[i] - b[j]) != c[i][j])
        return;
  solve(a, b);
}

void solveb(int x, int op) {
  static int a[kMaxN], b[kMaxN];
  std::fill_n(a + 1, n, 0);
  std::fill_n(b + 1, m, 0);
  b[x] = 0;
  for (int i = 1; i <= n; ++i) {
    if (!op) a[i] = b[x] + c[i][x];
    else a[i] = b[x] - c[i][x];
  }
  int mx = std::max_element(a + 1, a + 1 + n) - a, mi = std::min_element(a + 1, a + 1 + n) - a;
  if (a[mx] == a[mi]) {
    int d = abs(n - m);
    for (int i = 1; i <= m; ++i) {
      if (c[mx][i] != c[mi][i]) return;
    }
    if (d) {
      static bool f[kMaxN][kMaxN];
      static int g[kMaxN][kMaxN];
      memset(f, 0, sizeof(f));
      f[0][0] = 1;
      for (int i = 1; i <= m; ++i) {
        for (int j = 0; j < d; ++j) {
          if (!f[i - 1][j]) continue;
          if (i == x) {
            f[i][(j + b[i] % d + d) % d] = 1;
            g[i][(j + b[i] % d + d) % d] = b[i];
          } else {
            int a1 = a[mx] - c[mx][i], a2 = a[mx] + c[mx][i];
            f[i][(j + a1 % d + d) % d] = 1;
            g[i][(j + a1 % d + d) % d] = a1;
            f[i][(j + a2 % d + d) % d] = 1;
            g[i][(j + a2 % d + d) % d] = a2;
          }
        }
      }
      int sum = 0;
      for (int i = 1; i <= n; ++i) sum += a[i];
      for (int r = sum % d; r <= sum % d; ++r) {
        if (f[m][r]) {
          for (int i = m; i; --i) {
            b[i] = g[i][r];
            r = (r - b[i] % d + d) % d;
          }
          break;
        }
      }
    } else {
      static int f[kMaxN * kMaxN];
      int sum = 0;
      for (int i = 1; i <= m; ++i) sum += c[mx][i];
      if (sum & 1) return;
      memset(f, 0, sizeof(f));
      sum /= 2;
      f[0] = 1;
      int tmp = 0;
      for (int i = 1; i <= m; ++i) {
        tmp += c[mx][i];
        for (int j = tmp; j >= c[mx][i]; --j)
          inc(f[j], f[j - c[mx][i]]);
      }
      if (!f[sum]) return;
      std::vector<int> vec;
      int now = sum;
      static bool vis[kMaxN];
      memset(vis, 0, sizeof(vis));
      for (int i = 1; i <= m; ++i) {
        if (!c[mx][i]) {
          for (int j = c[mx][i]; j <= now; ++j) f[j] = 1ll * f[j] * kInv2 % kMod;
        } else {
          for (int j = c[mx][i]; j <= now; ++j)
            dec(f[j], f[j - c[mx][i]]);
        }
        if (now >= c[mx][i] && f[now - c[mx][i]]) {
          vis[i] = 1, now -= c[mx][i];
        }
      }
      assert(!now);
      for (int i = 1; i <= m; ++i) {
        int o = (op == 0 ? -1 : 1);
        if (vis[i] != vis[x]) o = -o;
        b[i] = a[mx] + o * c[mx][i];
      }
    }
  } else {
    for (int i = 1; i <= m; ++i) {
      if (i == x) continue;
      if (abs(a[mi] - (a[mx] - c[mx][i])) == c[mi][i]) b[i] = a[mx] - c[mx][i];
      else b[i] = a[mx] + c[mx][i];
    }
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j)
      if (abs(a[i] - b[j]) != c[i][j])
        return;
  solve(a, b);
}

void dickdreamer() {
  std::cin >> n >> m;
  int x = 0, y = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      std::cin >> c[i][j];
      if (c[i][j] > c[x][y]) x = i, y = j;
    }
  }
  if (!x && !y) {
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= m; ++j)
        std::cout << 0 << ' ';
      std::cout << '\n';
    }
    return;
  }
  solvea(x, 0), solvea(x, 1), solveb(y, 0), solveb(y, 1);
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}