#include<bits/stdc++.h>

using namespace std;


#define mp make_pair
#define int long long
using vi = vector<int>;
using pii = pair<int, int>;

const int inf = 1e9;


int n, m, cnt;
vector<vi> a;
set<vi> res;

vi operator^(const vi &a, const vi &b) {
    vi c(n);
    for (int i = 0; i < n; i++)
        c[i] = a[b[i]];
    return c;
}

void init() {
    int x = 1, y = 1;
    for (int i = 1; x <= inf and i <= n; i++)
        x = x * i;
    for (int i = 1; y <= inf and i <= m; i++)
        y = y * 2;
    cnt = min(x, y);
    return;
}

void dfs(int i, vi v, set<vi> vis) {
    res.insert(v);
    if ((int) res.size() == cnt) {
        cout << cnt << "\n";
        exit(0);
    }
    if (i == m) return;

    dfs(i + 1, v, vis);

    auto t = v ^ a[i];
    if (vis.insert(t).second == false) return;
    dfs(i + 1, t, vis);
    return;
}

int32_t main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    cin >> n >> m;
//    init();
    a = vector(m, vi(n));
    for (int i = 0; i < m; i++)
        for (int j = 0; j < n; j++)
            cin >> a[i][j], a[i][j]--;
    vector<set<vi>> f(m);
    f[0].insert(a[0]);
    for (int i = 1; i < m; i++) {
        f[i] = f[i - 1];
        f[i].insert(a[i]);
        for (const auto &it: f[i - 1])
            f[i].insert(it ^ a[i]);
    }
    cout << (int) f.back().size() << "\n";

    return 0;
}