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

vector<int> comb(vector<int> a, vector<int> b) {
  vector<int> c(a.size());
  for (size_t i = 0; i < c.size(); ++i)
    c[i] = a[b[i]];
  return c;
}

void solve1(int n, int m) {
  vector<vector<int>> a(m);
  for (auto &ai: a) {
    ai.resize(n);
    for (auto &aij : ai) {
      cin >> aij;
      --aij;
    }
  }
  vector<int> p(n);
  iota(p.begin(), p.end(), 0);
  map<vector<int>, int> o;
  vector<vector<int>> r;
  do {
    r.push_back(p);
    o.emplace(p, o.size());
  } while (next_permutation(p.begin(), p.end()));
  auto me = vector(o.size(), false);
  for (int i = 0; i < m; ++i) {
    auto he = me;
    he[o[a[i]]] = true;
    for (size_t j = 0; j < r.size(); ++j) {
      if (me[j])
        he[o[comb(r[j], a[i])]] = true;
    }
    me = he;
  }
  int ans = 0;
  for (auto ok : me)
    ans += ok;
  cout << ans << '\n';
}

void solve2(int n, int m) {
  vector<vector<int>> a(m);
  for (auto &ai: a) {
    ai.resize(n);
    for (auto &aij : ai) {
      cin >> aij;
      --aij;
    }
  }
  set<vector<int>> s;
  const uint32_t m2 = 1u << m;
  for (uint32_t S = 1; S < m2; ++S) {
    vector<int> p(n);
    iota(p.begin(), p.end(), 0);
    for (int i = 0; i < m; ++i) {
      if (((S >> i) & 1) == 0)
        continue;
      p = comb(p, a[i]);
    }
    s.insert(p);
  }
  cout << s.size() << '\n';
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  if (n <= 10) {
    solve1(n, m);
  } else {
    solve2(n, m);
  }
  return 0;
}