#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int N = 362880 + 10;
int dp[181][N];
int p[180];
int a[181][181];
int b[180];
int n, m, d[185];
const int mod = 1e9 + 7;
map<string, int> ccc;
map<vector<int>, int> ct;
void dfs(int u, int c[])
{
    if (u == m)
    {
        if (!c[1])
            return;
        vector<int> p;
        for (int i = 1; i <= n; i++)
        {
            //   cout << c[i] << " ";
            p.push_back(c[i]);
        }
        //  cout << endl;
        ct[p] = 1;
        return;
    }
    int tmp[24];
    for (int i = 1; i <= n; i++)
        tmp[i] = c[i];
    dfs(u + 1, tmp);
    if (tmp[1])
    {
        for (int i = 1; i <= n; i++)
        {
            d[i] = tmp[a[u + 1][i]];
        }
        dfs(u + 1, d);
    }
    else
        dfs(u + 1, a[u + 1]);
}

void solve()
{
    cin >> n >> m;
    int ans = 0;
    for (int i = 1; i <= m; i++)
    {
        for (int j = 1; j <= n; j++)
            cin >> a[i][j];
    }
    for (int i = 1; i <= n; i++)
        p[i] = i;

    if (m > 20)
    {
        map<int, int> mp;
        map<string, int> val;
        int r = 0;
        do
        {
            r++;
            string tmp;
            for (int i = 1; i <= n; i++)
                tmp += '0' + p[i];
            val[tmp] = r;
        } while (next_permutation(p + 1, p + 1 + n));

        for (int i = 1; i <= m; i++)
        {
            int rr = 0;
            for (int j = 1; j <= n; j++)
                p[j] = j;
            int r = 0;
            do
            {
                r++;
                if (!dp[i - 1][r])
                    continue;
                dp[i][r] = 1;
                string tmp;
                for (int j = 1; j <= n; j++)
                {
                    b[j] = a[i][p[j]];
                    tmp += '0' + b[j];
                }
                dp[i][val[tmp]] = 1;
            } while (next_permutation(p + 1, p + 1 + n));
            string tmp;
            for (int j = 1; j <= n; j++)
                tmp += '0' + a[i][j];
            dp[i][val[tmp]] = 1;
            // for(int j=0;j<N;j++) rr+=dp[i][j];
            // cout<<i<<' '<<rr<<endl;
        }
        for (int i = 0; i < N; i++)
            ans += dp[m][i];
        cout << ans % mod;
    }
    else
    {
        dfs(0, d);
        cout << ct.size() << "\n";
    }
}

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