#include <bits/stdc++.h>

using namespace std;

const int N = 1005;

int vis[N];
vector<int> G[N];

void dfs(int x)
{
    vis[x] = 1;
    for (auto v : G[x]) if (!vis[v]) dfs(v);
}

signed main()
{
    int n, m, res = 0;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            vis[j] = 0;
        }
        for (int j = 1, x; j <= m; ++j) {
            scanf("%d", &x);
            if (vis[x]) {
                G[x].push_back(m + i);
                ++res;
            }
            vis[x] = 1;
        }
        for (int j = 1; j <= m; ++j) {
            if (!vis[j]) {
                G[m + i].push_back(j);
            }
        }
    }
    for (int i = 1; i <= m + n; ++i) {
        vis[i] = 0;
    }
    for (int i = 1; i <= m; ++i) {
        if (G[i].size() && !vis[i]) {
            dfs(i);
            ++res;
        }
    }
    for (int i = m + 1; i <= m + n; ++i) {
        assert(!G[i].size() || vis[i]);
    }
    printf("%d\n", res);
    return 0;
}