#include <bits/stdc++.h>
#ifndef LOCAL
#define debug(...) 42
#else
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#endif
#define rep1(a) for (int i = 0; i < a; i++)
#define rep2(i, a) for (int i = 0; i < a; i++)
#define rep3(i, a, b) for (int i = a; i < b; i++)
#define rep4(i, a, b, c) for (int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define pb emplace_back
using namespace std;
template <typename T, typename T2> void cmin(T &x, const T2 &y) {
  x = x < y ? x : y;
}
template <typename T, typename T2> void cmax(T &x, const T2 &y) {
  x = x > y ? x : y;
}
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
template <class T> using vc = vector<T>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
mt19937 rng(time(NULL));
const int inf = 1000000000;
const ll lnf = 1000000000000000000;
#define sz(x) int((x).size())
#define all(x) begin(x), end(x)
#define fi first
#define se second

void solve() {
  int n, m;
  cin >> n >> m;
  vc<vi> a(m, vi(n));
  rep(i, m) rep(j, n) cin >> a[i][j], --a[i][j];
  if (m <= 18) {
    set<vi> ok;
    rep(s, 1, 1 << m) {
      vi p(n);
      iota(all(p), 0);
      rep(i, m) if (s >> i & 1) {
        vi np(n);
        iota(all(np), 0);
        rep(j, n) np[j] = a[i][p[j]];
        swap(p, np); 
      }
      ok.emplace(p);
    }
    cout << ok.size() << "\n";
  } else { // assume n <= 10
    set<vi> ok, ok2;
    vi p(n);
    rep(i, m) {
      ok2 = ok;
      for (auto v : ok) {
        iota(all(p), 0);
        rep(j, n) {
          p[j] = a[i][v[j]];
        }
        ok2.emplace(p);
      }

      ok2.emplace(a[i]);
      ok.swap(ok2);
    }

    cout << ok.size() << "\n";
  }
}

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