#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define all(a) begin(a), end(a)
template <class T> bool chmin(T &a, T b) {
  if (a <= b)
    return 0;
  a = b;
  return 1;
}
template <class T> bool chmax(T &a, T b) {
  if (a >= b)
    return 0;
  a = b;
  return 1;
}

using perm = vector<int>;
perm op(perm p, const perm &q) {
  for (auto &e : p)
    e = q[e];
  return p;
}

void solve() {
  int n, m;
  cin >> n >> m;
  vector<perm> p(m);
  for (auto &r : p) {
    r.resize(n);
    for (auto &e : r)
      cin >> e, e--;
  }
  if (m <= 20) {
    vector<perm> res;
    rep(s, 1, 1 << m) {
      perm t(n);
      iota(all(t), 0);
      rep(i, 0, m) {
        if (s >> i & 1)
          t = op(t, p[i]);
      }
      res.push_back(t);
    }
    sort(all(res));
    res.erase(unique(all(res)), res.end());
    cout << res.size() << "\n";
  } else {
    set<perm> res;
    rep(i, 0, m) {
      vector<perm> nx;
      nx.push_back(p[i]);
      for (const auto &e : res)
        nx.push_back(op(e, p[i]));
      for (auto &e : nx)
        res.insert(move(e));
    }
    cout << res.size() << "\n";
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t = 1;
  // cin >> t;
  while (t--)
    solve();
  return 0;
}