/*
60 + 0 + 100 + 64 = 224.
*/

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 189, mod = 1e9 + 7;
inline void add(int &x, int y) {x = (x + y) % mod;}
inline void del(int &x, int y) {x = (x - y + mod) % mod;}
int n, m, a[N][N], ans, p[N], tmp[N];
vector<int> r;
map<vector<int>, int> mp;
inline void solve1()
{
	L(i, 1, (1 << n) - 1)
	{
		L(j, 1, m) p[j] = j;
		L(j, 0, n - 1)
			if(i & (1 << j))
			{
				L(k, 1, m) tmp[k] = p[a[j + 1][k]];
				L(k, 1, m) p[k] = tmp[k];
			}
		r.clear();
		L(j, 1, m) r.pb(p[j]);
		if(!mp[r]) mp[r] = 1, ans++;
	}
	cout << ans % mod << endl; return ;
}
vector<int> G[362889];
bool fl = 0;
inline void trans(vector<int> x, int k)
{
	L(i, 1, m) p[i] = x[i - 1];
	L(i, 1, m) tmp[i] = p[a[k][i]]; r.clear();
	L(i, 1, m) r.pb(tmp[i]);
	if(!mp[r])
		mp[r] = 1, ans++; 
	bool ee = 0;
	L(i, 1, m)
		if(tmp[i] != i) ee = 1;
	if(!ee && !fl)
	{
		fl = 1, ans++; 
	}
	return ;
}
inline void solve2()
{
	r.clear();
	L(i, 1, m) r.pb(i); mp[r] = 1;
	L(i, 1, n)
	{
  		int cnt = 0;
		for (auto v : mp) G[++cnt] = v.first;
		L(j, 1, cnt) trans(G[j], i);
	}
	cout << ans % mod << endl; return ;
}
signed main()
{
	m = read(), n = read();
	L(i, 1, n)
		L(j, 1, m) a[i][j] = read();
	if(n <= 18) solve1();
	else solve2();
	return 0;
}