#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 3;
const int M = 1e7;
const ll INF = 5e18;

int n, m;
ll mod = 1e9 + 7;
ll qpow(ll x, ll y) {
    ll sum = 1;
    while (y) {
        if (y & 1)sum = sum * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return sum;
}
void solve()
{
    cin >> n >> m;
    set<array<int,50>> st;
    array<int,50> a;
    for (int i = 0; i < n; i++)cin >> a[i];
    st.insert(a);
    int cnt = m - 1;
    for (int j = 1; j < m; j++) {
        bool flag = 1;
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            if (a[i] != i + 1)flag = 0;
        }
        if(st.find(a) ==st.end())
        st.insert(a);
        if (flag == 1)cnt--;
    }
    cout << (qpow(2, min(cnt, m - 1)) - (m - st.size()) + mod) % mod;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    solve();
    return 0;
}