#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigMod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T modInverse(T a, T M) {
  return bigMod(a, M - 2, M);
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T>
inline string int2String(T a) {
  ostringstream str;
  str << a;
  return str.str();
}
template <class T>
inline T string2int(string a) {
  stringstream str(a);
  T b;
  str >> b;
  return b;
}
const int dr[] = {0, 1, 0, -1, -1, 1, 1, -1, -2, -2, 2, 2, -1, -1, 1, 1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1, -1, 1, -1, 1, -2, 2, -2, 2};
vector<int> G[200005];
int par[200005];
long long cnt[200005];
void preCalc(int n) {
  for (int i = 1; i <= n; i++) par[i] = i, cnt[i] = 1LL;
}
int uni(int u) {
  if (u == par[u]) return u;
  return par[u] = uni(par[u]);
}
void con(int x, int y) {
  int u = uni(x), v = uni(y);
  if (cnt[u] >= cnt[v]) {
    cnt[u] += cnt[v];
    par[v] = u;
  } else {
    cnt[v] += cnt[u];
    par[u] = v;
  }
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  preCalc(n);
  for (int i = 0; i < int(m); i++) {
    int prv = -1;
    for (int i = 0; i < n; i++) {
      int x;
      scanf("%d", &x);
      G[x].push_back(prv);
      prv = x;
    }
  }
  for (int i = 0; i < int(n + 1); i++) {
    sort(G[i].begin(), G[i].end()),
        (G[i]).erase(unique(G[i].begin(), G[i].end()), G[i].end());
    if (G[i].size() == 1) {
      con(i, G[i][0]);
    }
  }
  long long ans = 0;
  for (int i = int(1); i < int(n + 1); i++) {
    if (par[i] == i) {
      ans += cnt[i] * (cnt[i] + 1) >> 1LL;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
