Problem: Dora loves adventures quite a lot. During some journey she encountered an amazing city, which is formed by n streets along the Eastern direction and m streets across the Southern direction. Naturally, this city has nm intersections. At any intersection of i-th Eastern street and j-th Southern street there is a monumental skyscraper. Dora instantly became curious and decided to explore the heights of the city buildings.

When Dora passes through the intersection of the i-th Eastern and j-th Southern street she examines those two streets. After Dora learns the heights of all the skyscrapers on those two streets she wonders: how one should reassign heights to the skyscrapers on those two streets, so that the maximum height would be as small as possible and the result of comparing the heights of any two skyscrapers on one street wouldn't change.

Formally, on every of nm intersections Dora solves an independent problem. She sees n + m - 1 skyscrapers and for each of them she knows its real height. Moreover, any two heights can be compared to get a result "greater", "smaller" or "equal". Now Dora wants to select some integer x and assign every skyscraper a height from 1 to x. When assigning heights, Dora wants to preserve the relative order of the skyscrapers in both streets. That is, the result of any comparison of heights of two skyscrapers in the current Eastern street shouldn't change and the result of any comparison of heights of two skyscrapers in current Southern street shouldn't change as well. Note that skyscrapers located on the Southern street are not compared with skyscrapers located on the Eastern street only. However, the skyscraper located at the streets intersection can be compared with both Southern and Eastern skyscrapers. For every intersection Dora wants to independently calculate the minimum possible x.

For example, if the intersection and the two streets corresponding to it look as follows:

<image>

Then it is optimal to replace the heights of the skyscrapers as follows (note that all comparisons "less", "equal", "greater" inside the Eastern street and inside the Southern street are preserved)

<image>

The largest used number is 5, hence the answer for this intersection would be 5.

Help Dora to compute the answers for each intersection.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 1000) — the number of streets going in the Eastern direction and the number of the streets going in Southern direction.

Each of the following n lines contains m integers a_{i,1}, a_{i,2}, ..., a_{i,m} (1 ≤ a_{i,j} ≤ 10^9). The integer a_{i,j}, located on j-th position in the i-th line denotes the height of the skyscraper at the intersection of the i-th Eastern street and j-th Southern direction.

Output

Print n lines containing m integers each. The integer x_{i,j}, located on j-th position inside the i-th line is an answer for the problem at the intersection of i-th Eastern street and j-th Southern street.

Examples

Input


2 3
1 2 1
2 1 2


Output


2 2 2 
2 2 2 


Input


2 2
1 2
3 4


Output


2 3 
3 2 

Note

In the first example, it's not possible to decrease the maximum used height for the problem at any intersection, hence we don't have to change any heights.

In the second example, the answers are as follows: 

  * For the intersection of the first line and the first column <image>
  * For the intersection of the first line and the second column <image>
  * For the intersection of the second line and the first column <image>
  * For the intersection of the second line and the second column <image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long P = 998244353;
const int INF = 0x3fffffff;
const int N = 1005;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
set<int> s1[N], s2[N];
int a[N][N], b[N], nc[N], nr[N], ranki[N][N], rankj[N][N];
int m, n;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = (1); i <= (n); ++i)
    for (int j = (1); j <= (m); ++j) scanf("%d", a[i] + j);
  for (int i = (1); i <= (n); ++i) {
    memcpy(b, a[i], sizeof b);
    sort(b + 1, b + m + 1);
    int n1 = unique(b + 1, b + m + 1) - b - 1;
    for (int j = (1); j <= (m); ++j)
      ranki[i][j] = lower_bound(b + 1, b + n1 + 1, a[i][j]) - b;
    nr[i] = n1;
  }
  for (int j = (1); j <= (m); ++j) {
    for (int i = (1); i <= (n); ++i) b[i] = a[i][j];
    sort(b + 1, b + n + 1);
    int n1 = unique(b + 1, b + n + 1) - b - 1;
    for (int i = (1); i <= (n); ++i)
      rankj[i][j] = lower_bound(b + 1, b + n1 + 1, a[i][j]) - b;
    nc[j] = n1;
  }
  for (int i = (1); i <= (n); ++i)
    for (int j = (1); j <= (m); ++j) {
      int ans = max(ranki[i][j], rankj[i][j]);
      ans += max(nr[i] - ranki[i][j], nc[j] - rankj[i][j]);
      printf("%d%c", ans, j == m ? '\n' : ' ');
    }
  return 0;
}