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

vector<vector<int>> mp;

int n, m;
set<vector<int>> st;

vector<int> cal1(vector<int> it, int id) {
    vector<int> a = it;
    for (int i = 0; i < n; ++i)
        it[i] = a[mp[id][i] - 1];
    return it;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> m;
    mp.resize(m, vector<int>(n));

    for (int i = 0; i < m; ++i)
        for (int j = 0; j < n; ++j)
            cin >> mp[i][j];

    for (int i = 0; i < m; ++i) {
        set<vector<int>> add;
        for (auto &it : st) {
            add.insert(cal1(it, i));
        }
        st.insert(mp[i]);
        for (auto &it : add)
            st.insert(it);
    }
    cout << st.size() << '\n';
    return 0;
}