#include "bits/stdc++.h"
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

  int n, m;
  cin >> m >> n;
  vector<vi> a(n, vi(m));
  for (auto& x : a) for (auto& y : x) cin >> y, y--;
  reverse(a.begin(), a.end());
  set<vi> perms;
  if (n <= 20) {
    for (int mask = 1; mask < (1<<n); mask++) {
      vi p(m);
      iota(p.begin(), p.end(), 0);
      rep(b, 0, n) {
        if (mask>>b&1) {
          vi q(m);
          rep(i, 0, m)
            q[i] = a[b][p[i]];
          p = std::move(q);
        }
      }
      // Insert q in some set and test??
      perms.insert(p);
    }
  } else {
    rep(i, 0, n) {
      set<vi> created_set;
      for (auto& perm : perms) {
        vi res(m);
        rep(j, 0, m)
          res[j] = a[i][perm[j]];
        created_set.insert(res);
      }
      perms.merge(created_set);
      perms.insert(a[i]);
    }
  }
  cout << perms.size() << '\n';
}