#pragma GCC optimize(2)
#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
typedef long long ll;
typedef __int128_t int128;
typedef pair<int, int> pii;
#define iofast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define lowbit(x) (x&(-x))
#define inv(x) qpow(x,mod-2)
#define debug(x) cout << (#x) << " = " << x << endl
#define range(x) (x).begin(), (x).end()

const int iINF = 0x3f3f3f3f;
const ll llINF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1000000007;

/*---------------------------------------*/
__gnu_pbds::gp_hash_table<string, int>idx;
string mp[1000005];

// bool dp[1000005], use[1000005];
bitset<1000005>dp, use;

string convert(const string& a, const string& b)
{
    int n = a.size();
    string c;
    c.resize(n);

    for (int i = 0;i < n;++i)
        c[i] = a[b[i] - 1 - '0'];
    return c;
}

vector<int> convert(const vector<int>& a, const vector<int>& b)
{
    int n = a.size();
    vector<int>c(n);

    for (int i = 0;i < n;++i)
        c[i] = a[b[i] - 1];
    return c;
}
void solve()
{
    int n, m;
    cin >> n >> m;
    swap(n, m);

    if (m < 10) {
        vector<string>v(n);

        for (auto& c : v) {
            c.resize(m);
            for (auto& cc : c)
                cin >> cc;
        }
        v.insert(v.begin(), "");
        string s;
        for (int i = 1;i <= m;++i)
            s += to_string(i);

        int id = 0;
        do {
            idx[s] = id++;
            mp[id - 1] = s;
        } while (next_permutation(range(s)));

        for (int i = 1;i <= n;++i) {
            for (int j = 0;j < id;++j)
                if (dp[j])
                    use[idx[convert(mp[j], v[i])]] = 1;
            use[idx[v[i]]] = 1;

            dp |= use;
            use.reset();
            // for (int j = 0;j < id;++j)
            //     dp[j] |= use[j], use[j] = 0;
        }
        cout << dp.count() << '\n';
    }
    else {
        vector<vector<int>>v(n, vector<int>(m));
        for (auto& c : v)
            for (auto& cc : c)
                cin >> cc;
        int limit = (1 << n);
        set<vector<int>>st;
        for (int i = 1;i < limit;++i) {
            vector<int> s;

            for (int j = 0;j < n;++j) {
                int tag = (1 << j);
                if (i & tag)
                    if (s.empty())
                        s = v[j];
                    else
                        s = convert(s, v[j]);
            }
            // cout << s << '\n';
            st.insert(s);
        }

        cout << st.size() << '\n';
    }
}

/*---------------------------------------*/

int main()
{
    iofast;
    int t = 1;
    // cin >> t;
    while (t--)
        solve();

    return 0;
}