#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;

#define ll long long
#define ull unsigned long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define vt vector
#define vll vt<ll>
#define pll pair<ll,ll>
#define vpll vt<pll>
#define vvll vt<vll>
#define all(v) v.begin(),v.end()
#define FOR(i,n) for(ll i=0;i<n;i++)
#define ffo(i,a,b) for(ll i=a;i<=b;i++)
#define rfo(i,a,b) for(ll i=a;i>=b;i--)
#define space cout<<"\n\n";
#define endl "\n"
#define pqmx priority_queue<ll>
#define pqmn priority_queue<ll,vll,greater<ll>>
#define fps(x,y) fixed<<setprecision(y)<<x
#define merg(a,b,c) set_union(a.begin(),a.end(),b.begin(),b.end(),inserter(c,c.begin()))
#define set_ar(arr,v) memset(arr,v,sizeof(arr))
#define go_t int testcases; cin>>testcases; ffo(caseno,1,testcases)

#define ctime auto start = high_resolution_clock::now()
#define etime auto stop = high_resolution_clock::now()
#define ptime auto z1z = duration_cast<microseconds>(stop-start); cout<<"Time elapsed : "<<z1z.count()<<" microseconds\n"

#define dbg1(x)             cout <<#x<<": "<<x<<'\n';
#define dbg2(x, y)          cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<<'\n';
#define dbg3(x, y, z)       cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<'\n';
#define dbg4(a, b, c, d)    cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<'\n';
#define dbg5(a, b, c, d, e) cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<<": "<<e<<'\n';

const ll mod = 1e9 + 7;
const ll N = 1e6 + 6;
const ll maxN = 50 + 5;
const ll MAX_SIZE = 2e6 + 6;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const double PI = 3.14159265359;

ll powerM(ll x, ll y, ll M = mod) { // default argument
	ll v = 1; x = x % M; while (y > 0) {if (y & 1)v = (v * x) % M; y = y >> 1; x = (x * x) % M;} return v;
}

ll power(ll x, ll y) {
	ll v = 1; while (y > 0) {if (y & 1)v = v * x; y = y >> 1; x = x * x;} return v;
}

ll n, k;
vvll m1(maxN, vll(maxN, 0));
vvll ide(maxN, vll(maxN, 0));

void matmul(vvll& mat1, vvll& mat2) {
	// mat 1 * mat 2
	// int n1 = mat1.size(), m1 = mat1[0].size();
	// int n2 = mat2.size(), m2 = mat2[0].size();
	// if (m1 != n2) exit(1);
	int n1 = n, m2 = n, n2 = n;
	vvll temp(n1, vll(m2));
	for (int i = 0; i < n1; i++) {
		for (int j = 0; j < m2; j++) {
			temp[i][j] = 0;
			for (int k = 0; k < n2; k++) {
				temp[i][j] += (mat1[i][k] % mod * mat2[k][j] % mod) % mod;
				temp[i][j] %= mod;
			}
			temp[i][j] %= mod;
		}
	}
	for (int i = 0; i < n1; i++) {
		for (int j = 0; j < m2; j++) {
			mat1[i][j] = temp[i][j];
		}
	}
}

void cal() {
	ll p = k;
	for (int i = 0; i < n; ++i)
		ide[i][i] = 1;
	while (p > 0) {
		if (p % 2 != 0) {
			matmul(ide, m1);
			--p;
		}
		matmul(m1, m1);
		p = p / 2;
	}
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("in1.txt", "r", stdin);
	freopen("out1.txt", "w", stdout);
#endif
	FIO
	cin >> n >> k;
	FOR(i, n) {
		FOR(j, n) {
			cin >> m1[i][j];
		}
	}
	cal();
	ll sum = 0;
	FOR(i, n) {
		FOR(j, n) {
			sum += ide[i][j];
			sum %= mod;
		}
	}
	cout << sum;
	return 0;
}


Measured memory_bytes: 3760