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
| #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
const int mod=1e9+7;
ll n,k;
struct Matrix{
ll a[109][109];
friend Matrix operator*(const Matrix &x,const Matrix &y){
Matrix res;
for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)res.a[i][j]=0;
for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)for(int k=1;k<=n;++k)res.a[i][j]=(res.a[i][j]+x.a[i][k]*y.a[k][j])%mod;
return res;
}
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>k;
Matrix a;
Matrix res;
f(i,1,n)f(j,1,n)cin>>a.a[i][j];
f(i,1,n)res.a[i][i]=1;
for(;k>0;k>>=1,a=a*a)if(k&1)res=res*a;
f(i,1,n)f(j,1,n)cout<<res.a[i][j]<<" \n"[n==j];
return 0;
}
|