#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
struct UF {
	vi e;
	UF(int n) : e(n, -1) {}
	bool sameSet(int a, int b) { return find(a) == find(b); }
	int size(int x) { return -e[find(x)]; }
	int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); }
	void join(int a, int b) {
		a = find(a), b = find(b);
		if (a == b) return;
		if (e[a] > e[b]) swap(a, b);
		e[a] += e[b]; e[b] = a;
	}
};

template <typename T> T mod_inv_in_range(T a, T m) {
	// assert(0 <= a && a < m);
	T x = a, y = m;
	// coeff of a in x and y
	T vx = 1, vy = 0;
	while (x) {
		T k = y / x;
		y %= x;
		vy -= k * vx;
		std::swap(x, y);
		std::swap(vx, vy);
	}
	assert(y == 1);
	return vy < 0 ? m + vy : vy;
}

template <typename T> struct extended_gcd_result {
	T gcd;
	T coeff_a, coeff_b;
};
template <typename T> extended_gcd_result<T> extended_gcd(T a, T b) {
	T x = a, y = b;
	// coeff of a and b in x and y
	T ax = 1, ay = 0;
	T bx = 0, by = 1;
	while (x) {
		T k = y / x;
		y %= x;
		ay -= k * ax;
		by -= k * bx;
		std::swap(x, y);
		std::swap(ax, ay);
		std::swap(bx, by);
	}
	return {y, ay, by};
}

template <typename T> T mod_inv(T a, T m) {
	a %= m;
	a = a < 0 ? a + m : a;
	return mod_inv_in_range(a, m);
}

template <int MOD_> struct modnum {
	static constexpr int MOD = MOD_;
	static_assert(MOD_ > 0, "MOD must be positive");

private:
	int v;

public:

	modnum() : v(0) {}
	modnum(int64_t v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; }
	explicit operator int() const { return v; }
	friend std::ostream& operator << (std::ostream& out, const modnum& n) { return out << int(n); }
	friend std::istream& operator >> (std::istream& in, modnum& n) { int64_t v_; in >> v_; n = modnum(v_); return in; }

	friend bool operator == (const modnum& a, const modnum& b) { return a.v == b.v; }
	friend bool operator != (const modnum& a, const modnum& b) { return a.v != b.v; }

	modnum inv() const {
		modnum res;
		res.v = mod_inv_in_range(v, MOD);
		return res;
	}
	friend modnum inv(const modnum& m) { return m.inv(); }
	modnum neg() const {
		modnum res;
		res.v = v ? MOD-v : 0;
		return res;
	}
	friend modnum neg(const modnum& m) { return m.neg(); }

	modnum operator- () const {
		return neg();
	}
	modnum operator+ () const {
		return modnum(*this);
	}

	modnum& operator ++ () {
		v ++;
		if (v == MOD) v = 0;
		return *this;
	}
	modnum& operator -- () {
		if (v == 0) v = MOD;
		v --;
		return *this;
	}
	modnum& operator += (const modnum& o) {
		v -= MOD-o.v;
		v = (v < 0) ? v + MOD : v;
		return *this;
	}
	modnum& operator -= (const modnum& o) {
		v -= o.v;
		v = (v < 0) ? v + MOD : v;
		return *this;
	}
	modnum& operator *= (const modnum& o) {
		v = int(int64_t(v) * int64_t(o.v) % MOD);
		return *this;
	}
	modnum& operator /= (const modnum& o) {
		return *this *= o.inv();
	}

	friend modnum operator ++ (modnum& a, int) { modnum r = a; ++a; return r; }
	friend modnum operator -- (modnum& a, int) { modnum r = a; --a; return r; }
	friend modnum operator + (const modnum& a, const modnum& b) { return modnum(a) += b; }
	friend modnum operator - (const modnum& a, const modnum& b) { return modnum(a) -= b; }
	friend modnum operator * (const modnum& a, const modnum& b) { return modnum(a) *= b; }
	friend modnum operator / (const modnum& a, const modnum& b) { return modnum(a) /= b; }
};

template <typename T> T pow(T a, long long b) {
	assert(b >= 0);
	T r = 1; while (b) { if (b & 1) r *= a; b >>= 1; a *= a; } return r;
}

using num = modnum<int(1e9)+7>;

int main(){
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int N, K;
	cin >> N >> K;
	vector<vector<int> > perms(K, vector<int>(N));
	// {
	// 	mt19937 mt(600);
	// 	for(int i = 0; i < K; i++){
	// 		for(int j = 0; j < N; j++){
	// 			perms[i][j] = j;
	// 		}
	// 		shuffle(perms[i].begin(), perms[i].end(), mt);
	// 	}
	// }
	for(int i = 0; i < K; i++){
		for(int j = 0; j < N; j++){
			cin >> perms[i][j];
			perms[i][j]--;
		}
	}
	{
		mt19937 mt_basis(4800023);
		shuffle(perms.begin(), perms.end(), mt_basis);
		for(int i = 0; i < 300000; i++){
			int a = int(mt_basis() % K);
			int b = int(mt_basis() % K);
			if(a == b) continue;
			for(int j = 0; j < N; j++){
				perms[b][j] = perms[a][perms[b][j]];
			}
		}
	}
	vector<vector<int> > perms_transpose(N, vector<int>(2*K));
	for(int i = 0; i < 2*K; i++){
		for(int j = 0; j < N; j++){
			perms_transpose[j][i] = perms[i%K][j];
		}
	}
	UF uf(N * N);

	mt19937 mt(48235);
	int ROUNDS = min(35, K);
	vector<vector<int> > joins(N, vector<int>(ROUNDS));
	for(int s = 0; s < N; s++){
		int a = mt() % K;
		for(int t = 0; t < N; t++){
			if(s == t) continue;
			for(int i = 0; i < ROUNDS; i++){
				uf.join(s * N + t, perms_transpose[s][a] * N + perms_transpose[t][a]);
				a++;
			}
			if(a >= K) a -= K;
		}
	}
	vector<int> cnt_less(N*N, 0);
	vector<int> cnt_more(N*N, 0);
	for(int s = 0; s < N; s++){
		for(int t = 0; t < N; t++){
			if(s == t) continue;
			int x = uf.find(s * N + t);
			if(s < t) cnt_less[x]++;
			if(s > t) cnt_more[x]++;
		}
	}
	num ans = 0;
	for(int i = 0; i < N*N; i++){
		int a = cnt_less[i];
		int b = cnt_more[i];
		if(a || b){
			ans += num(a) * num(b) / num(a+b);
		}
	}
	cout << ans << '\n';
}