1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
#pragma GCC optimize("Ofast")
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
#define ll long long
#define ull unsigned long long int
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define pss pair<short,short>
#define pld pair<long double,long double >
#define ld long double
#define piii  pair<pii,int>
#define vii vector<pair<int,int> >
#define st first
#define nd second
#define pll pair<ll,ll>
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define M_PI 3.14159265358979323846
//#define int long long
const int mod=1000000007;
//const int mod=1009;
//const int mod=998244353;
const int inf=1000000009;
const long long INF=1000000000000000009;
const long long big=1000000000000000;
const long double eps=0.000000000000000000001;
const int rozmiar=3005;
pii R[rozmiar][rozmiar];
int P[rozmiar][rozmiar],S[rozmiar][rozmiar],G[rozmiar][rozmiar],Permutacja[rozmiar];
int Pow(int a,int b){
    int wynik=1;
    while(b){
        if(b&1)
            wynik=((ll)wynik*a)%mod;
        a=((ll)a*a)%mod;
        b/=2;
    }
    return wynik;
}
pii Find(pii x){
    if(R[x.st][x.nd]==x)
        return x;
    return R[x.st][x.nd]=Find(R[x.st][x.nd]);
}
void Union(pii a,pii b){
    pii x=Find(a),y=Find(b);
    if(x==y)
        return;
    if(S[x.st][x.nd]<S[y.st][y.nd])
        swap(x,y);
    R[y.st][y.nd]=x;
    S[x.st][x.nd]+=S[y.st][y.nd];
    G[x.st][x.nd]+=G[y.st][y.nd];
}
void solve()
{
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            R[i][j]=mp(i,j),S[i][j]=1;
            if(i<j)
                G[i][j]=1;
        }
    }
    for(int i=1;i<=k;i++)
        Permutacja[i]=i;
    for(int i=1;i<=k;i++)
        for(int j=1;j<=n;j++)
            cin>>P[i][j];
    random_shuffle(Permutacja+1,Permutacja+k+1);
    for(int i=1;i<=k;i++){
        //cout<<"siema "<<i<<" "<<Permutacja[i]<<" "<<clock()<<" "<<12.0*CLOCKS_PER_SEC<<"\n";
        if(clock()>12.0*CLOCKS_PER_SEC)
            break;
        //cout<<"elo "<<"\n";
        for(int j=1;j<=n;j++){
            for(int l=1;l<=n;l++){
                if(j==l)
                    continue;
                Union(mp(j,l),mp(P[Permutacja[i]][j],P[Permutacja[i]][l]));
            }
        }
    }
    ll wynik=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i==j||R[i][j]!=mp(i,j))
                continue;
            //cout<<"siema "<<i<<" "<<j<<" "<<S[i][j]<<" "<<G[i][j]<<"\n";
            ll aktual=((ll)G[i][j]*(S[i][j]-G[i][j]))%mod;
            aktual*=Pow(S[i][j],mod-2);
            wynik+=aktual;
            wynik%=mod;
        }
    }
    cout<<wynik;
}
    
int32_t main(){
    srand(1121);
    speed
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}