#include<bits/stdc++.h>
#define ll long long
#define int long long
#define pii make_pair
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
const ll inf = 1145141919810;
using namespace std;
inline ll read() {
	ll x=0,f=1;
	char c=getchar();
	while (c<'0' || c>'9') {
		if (c=='-')  f=-1;
		c=getchar();
	}
	while (c>='0' && c<='9') {
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
inline void print(ll x) {
	if(x < 0) putchar('-'), x = -x;
	if(x > 9) print(x / 10);
	putchar(x % 10 + '0');
	return ;
}
inline void pprint(ll x) {
	print(x);
	puts("");
}
const ll mod = 1e9 + 7;
const int N = 500 + 7;
map<string, int> mp;
ll c[N], d[N];
ll a[N][N];
ll n, m;
void slv1() {
	ll ans = 0;
	rep(j, 1, (1 << m) - 1) {
		vector<int> q;
		rep(k, 0, m - 1) {
			if((j >> k) & 1) {
				q.pb(k + 1);
			}
		}

		rep(i, 1, n) c[i] = a[q[0]][i];
		rep(k, 1, (int)q.size() - 1) {
			rep(i, 1, n) d[i] = c[a[q[k]][i]];
			rep(i, 1, n) c[i] = d[i];
		}

		string s = "";
		rep(i, 1, n) {
			s += c[i];
		}
		if(!mp[s]){
			mp[s] = 1;
			ans = (ans + 1) % mod;
		}
	}
	pprint(ans % mod);
}
set<string> st[3];
void slv2(){//n <= 10
	rep(k, 1, m){
		for(auto x:st[1]){
			rep(i, 1, n){
				c[i] = x[i - 1];
			}
			rep(i, 1, n){
				d[i] = c[a[k][i]];
			}
			string s = "";
			rep(i, 1, n){
				s += d[i];
			}
			st[2].insert(s);
		}
		for(auto x:st[2]){
			st[1].insert(x);
		}
		string s = "";
		rep(i, 1, n)
			s += a[k][i];
		st[1].insert(s);
		st[2].clear();
	}
	pprint(st[1].size() % mod);
}
signed main() {
	n = read(), m = read();
	rep(i, 1, m) {
		rep(j, 1, n)
		a[i][j] = read();
	}
	if(m <= 19){
		slv1();
	}else{
		slv2();
	}
	return 0;
}