#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
long long M1 = 1000000007;
long long M2 = 67280421310721;
long long M3 = 998244353;
long long INF = 1e18;
long long power(long long a, long long b, long long mod) {
  long long ans = 1;
  long long prod = a;
  while (b) {
    if (b % 2) ans = (ans * prod) % mod;
    prod = (prod * prod) % mod;
    b /= 2;
  }
  return ans;
}
long long inv(long long a, long long mod) { return power(a, mod - 2, mod); }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long fact(long long n, long long mod) {
  long long f = 1;
  for (long long i = 1; i <= n; i++) f = (f * i) % mod;
  return f;
}
long long ncr(long long n, long long r, long long mod) {
  if (mod == 1) {
    return (fact(n, mod) / fact(r, mod)) / fact(n - r, mod);
  }
  return (((fact(n, mod) * inv(fact(r, mod), mod)) % mod) *
          inv(fact(n - r, mod), mod)) %
         mod;
}
void solve() {
  long long n, m;
  cin >> n >> m;
  long long i, j;
  long long a[n][m];
  for (i = 0; i < n; i++)
    for (j = 0; j < m; j++) cin >> a[i][j];
  vector<long long> row[n], col[m];
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      row[i].push_back(a[i][j]);
    }
    sort((row[i]).begin(), (row[i]).end());
    vector<long long> v;
    v.push_back(row[i][0]);
    for (j = 1; j < row[i].size(); j++) {
      if (row[i][j] == row[i][j - 1]) continue;
      v.push_back(row[i][j]);
    }
    row[i] = v;
  }
  for (j = 0; j < m; j++) {
    for (i = 0; i < n; i++) col[j].push_back(a[i][j]);
    sort((col[j]).begin(), (col[j]).end());
    vector<long long> v;
    v.push_back(col[j][0]);
    for (i = 1; i < col[j].size(); i++) {
      if (col[j][i] == col[j][i - 1]) continue;
      v.push_back(col[j][i]);
    }
    col[j] = v;
  }
  long long mat[n][m];
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      long long x =
          lower_bound(row[i].begin(), row[i].end(), a[i][j]) - row[i].begin();
      long long y =
          lower_bound(col[j].begin(), col[j].end(), a[i][j]) - col[j].begin();
      mat[i][j] =
          max(x, y) + 1 + max(row[i].size() - 1 - x, col[j].size() - 1 - y);
    }
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      cout << mat[i][j] << " ";
    }
    cout << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout << fixed << setprecision(10);
  auto start = high_resolution_clock::now();
  long long i, t = 1;
  for (i = 1; i <= t; i++) solve();
  auto stop = high_resolution_clock::now();
  auto duration = duration_cast<microseconds>(stop - start);
}
