#include <bits/stdc++.h>
using namespace std;
int main(){
  int n, m;
  cin >> n >> m;
  vector<vector<int>> A(m, vector<int>(n));
  for (int i = 0; i < m; i++){
    for (int j = 0; j < n; j++){
      cin >> A[i][j];
      A[i][j]--;
    }
  }
  if (n <= 20){
    vector<vector<int>> ans;
    for (int i = 1; i < (1 << m); i++){
      vector<int> p(n);
      for (int j = 0; j < n; j++){
        p[j] = j;
      }
      for (int j = 0; j < m; j++){
        if ((i >> j & 1) == 1){
          vector<int> q(n);
          for (int k = 0; k < n; k++){
            q[k] = p[A[j][k]];
          }
          p = q;
        }
      }
      ans.push_back(p);
    }
    sort(ans.begin(), ans.end());
    cout << unique(ans.begin(), ans.end()) - ans.begin() << endl;
  } else {
    vector<int> p(n);
    for (int i = 0; i < n; i++){
      p[i] = i;
    }
    int F = 1;
    for (int i = 1; i <= n; i++){
      F *= i;
    }
    vector<vector<int>> P;
    for (int i = 0; i < F + 1; i++){
      P.push_back(p);
      next_permutation(p.begin(), p.end());
    }
    vector<vector<bool>> dp(m + 1, vector<bool>(F + 1, false));
    dp[0][F] = true;
    for (int i = 0; i < m; i++){
      for (int j = 0; j <= F; j++){
        if (dp[i][j]){
          dp[i + 1][j] = true;
          vector<int> q(n);
          for (int k = 0; k < n; k++){
            q[k] = P[j][A[i][k]];
          }
          int idx = lower_bound(P.begin(), P.end() - 1, q) - P.begin();
          dp[i + 1][idx] = true;
        }
      }
    }
    int ans = 0;
    for (int i = 0; i < F; i++){
      if (dp[m][i]){
        ans++;
      }
    }
    cout << ans << endl;
  }
}