#include <bits/stdc++.h>

using namespace std;

#ifndef LOCAL
#define cerr \
  if (0) cerr
#endif

map<vector<int>, int> dp[185];
int a[185][185];
int n, m;

int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
#ifdef LOCAL
#define task "a"
#else
#define task ""
#endif
  if (fopen(task ".inp", "r")) {
    freopen(task ".inp", "r", stdin);
    freopen(task ".out", "w", stdout);
  }
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++) {
      cin >> a[i][j];
      // a[i][j]++;
    }
  }
  if (m <= 18) {
    vector<int> p;
    map<vector<int>, int> mp;
    for (int mask = 1; mask < 1 << m; mask++) {
      vector<int> c(n);
      iota(c.begin(), c.end(), 0);
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
          if (mask >> j & 1) {
            c[i] = a[j][c[i]];
          }
        }
      }
      ++mp[c];
    }
    cout << mp.size() << "\n";
    // for (auto [v, _] : mp) {
    //   for (int i : v) cerr << i << " ";
    //   cerr << endl;
    // }
    return 0;
  }
  // dp[i] = tap cac hoan vi khi xet i thang hoan vi dau
  vector<int> p(n);
  iota(p.begin(), p.end(), 0);

  // for (int i : p) cerr << i << ",";
  // cerr << endl;
  for (int i = 1; i <= m; i++) {
    dp[i] = dp[i - 1];
    for (auto [v, _] : dp[i - 1]) {
      vector<int> nv = v;
      for (int j = 0; j <= n; j++) {
        nv[j] = a[i][v[j]];
        // if (i == 1) cerr << j << " " << nv[j] << endl;
      }
      dp[i][nv] = 1;
    }
    dp[i][vector<int>(a[i], a[i] + n + 1)] = 1;
  }
  // dp[m][p]--;
  // if (dp[m][p] == 0) dp[m].erase(p);
  // for (auto [v, _] : dp[2]) {
  //   for (int i : v) cerr << i << " ";
  //   cerr << endl;
  // }
  cout << dp[m].size();
  return 0;
}