#include using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; int main(){ int H, W; cin >> H >> W; vector> A(H, vector(W)); rep(i, H){ rep(j, W){ cin >> A[i][j]; } } int MAX = 500000; vector> ps(MAX+1); rep(i, H){ rep(j, W){ ps[A[i][j]].eb(i, j); } } vector cx(H, 0), cy(W, 0); int sx = 0, sy = 0; ll ans = 0; rep3(i, MAX, 1){ each(e, ps[i]){ auto [x, y] = e; if(cx[x]++ == 0) sx++; if(cy[y]++ == 0) sy++; } ans += min(sx, sy); sx = 0, sy = 0; each(e, ps[i]){ auto [x, y] = e; cx[x]--, cy[y]--; } } cout << ans << '\n'; }