#include <bits/stdc++.h>
// #include <algorithm>
// #include <queue>
// #include <map>
// #include <iostream>
// #include <string>
// #include <set>
#define endl '\n'

using namespace std;

using LL = long long;
using PII = pair<int, int>;
using i128 = __int128_t;
using ULL = unsigned long long;

const int INF = 0x3f3f3f3f, MOD = 1e9 + 7, N = 1e6 + 5;
const LL LINF = 0x3f3f3f3f3f3f3f3f;

void solve()
{
    int n, m;
    cin >> n >> m;

    vector<vector<int>> a(m, vector<int>(n));
    for(int i = 0; i < m; i ++ )
    {
        for(int j = 0; j < n; j ++ )    
            cin >> a[i][j];
    }

    set<vector<int>> S;
    S.insert(a[0]);

    for(int i = 1; i < m; i ++ )
    {
        vector<int> tmp(n);
        
        auto S2 = S;
        S.insert(a[i]);
        
        for(auto vec : S2)
        {   
            for(int j = 0; j < n; j ++ )
            {
                tmp[j] = vec[a[i][j] - 1];
            }

            S.insert(tmp);
        }
    }
 
    cout << S.size() % MOD << endl;
}   

int main()
{
    // freopen("galactic.in", "r", stdin);
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int T = 1; 
    // cin >> T;

    while(T -- )
        solve();
    return 0;
}