#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline bool read(T &x) {
  int c = getchar();
  int sgn = 1;
  while (~c && c < '0' || c > '9') {
    if (c == '-') sgn = -1;
    c = getchar();
  }
  for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
  x *= sgn;
  return ~c;
}
const int INF = 2000000009;
const int MX = 1005;
const double EPS = 1e-9;
const int MOD = 1000000007;
int a[MX][MX];
vector<int> row[MX], col[MX];
int main() {
  int n = ({
    int a;
    read(a);
    a;
  }),
      m = ({
        int a;
        read(a);
        a;
      });
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      a[i][j] = ({
        int a;
        read(a);
        a;
      });
      row[i].push_back(a[i][j]);
      col[j].push_back(a[i][j]);
    }
  }
  for (int i = 0; i < n; i++) {
    sort(row[i].begin(), row[i].end());
    row[i].resize(unique(row[i].begin(), row[i].end()) - row[i].begin());
  }
  for (int i = 0; i < m; i++) {
    sort(col[i].begin(), col[i].end());
    col[i].resize(unique(col[i].begin(), col[i].end()) - col[i].begin());
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      int x =
          lower_bound(row[i].begin(), row[i].end(), a[i][j]) - row[i].begin();
      int y =
          lower_bound(col[j].begin(), col[j].end(), a[i][j]) - col[j].begin();
      int cur = max(x, y) + max(row[i].size() - x, col[j].size() - y);
      printf("%d ", cur);
    }
    printf("\n");
  }
  return 0;
}
