#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

const int MAXC = 1000005;

int arr[505][505], lft[MAXC], rgt[MAXC], up[MAXC], dwn[MAXC];
int cnt[505], adj[505][505], tag[505][505], sum[505], vis[MAXC];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    ll ans = 0;
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            cin >> arr[i][j];
    fill(lft, lft + MAXC, 1000);
    fill(dwn, dwn + MAXC, 1000);
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j) {
            lft[arr[i][j]] = min(lft[arr[i][j]], j);
            rgt[arr[i][j]] = max(rgt[arr[i][j]], j);
            dwn[arr[i][j]] = min(dwn[arr[i][j]], i);
            up[arr[i][j]] = max(up[arr[i][j]], i);
        }

    for (int k = 2; k <= m; ++k)
        for (int i = 1; i <= n; ++i) {
            if (arr[i][k] == arr[i][k - 1] && vis[arr[i][k]] != k) {
                vis[arr[i][k]] = k;
                tag[i][k] = 1;
            }
        }

    memset(vis, 0, sizeof vis);
    for (int d = 1; d <= n; ++d) {
        fill(cnt, cnt + m + 1, 0);
        memset(adj, 0, sizeof adj);
        for (int u = d; u <= n; ++u) {
            vector<int> here;
            for (int k = 1; k <= m; ++k) {
                if (dwn[arr[u][k]] < d) continue;
                if (vis[arr[u][k]] != d && up[arr[u][k]] == u) {
                    vis[arr[u][k]] = d;
                    ++cnt[rgt[arr[u][k]]];
                    if (d == dwn[arr[u][k]]) here.pb(arr[u][k]);
                }
                adj[up[arr[u][k]]][k] += tag[u][k];
            }
            for (int k = 1; k <= m; ++k) {
                adj[u][k] += adj[u - 1][k];
                sum[k] = sum[k - 1] + cnt[k];
            }
            for (int k : here) {
                ans += sum[rgt[k]] - sum[lft[k] - 1] - adj[u][lft[k]] - 1;
            }
        }
    }
    cout << ans << "\n";
}