#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;
typedef vector<ll> Array;
typedef vector<Array> Matrix;

ostream& operator<<(ostream &os, const Array &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
ostream& operator<<(ostream &os, const Matrix &t) {
    FOR(it,t)os<<*it<<endl;return os;
}


Matrix mul(const Matrix &a,const Matrix &b,const ll MOD){
    Matrix res(a.size(),Array(b[0].size()));	// �댳������I
    REP(i,a.size()){
        REP(j,b[0].size()){
            REP(k,a[0].size()){
                res[i][j] += a[i][k]*b[k][j];
                if(res[i][j] >= MOD) res[i][j] %= MOD;
            }
        }
    }
    return res;
}
Matrix pow(const Matrix &a,ll b, const ll MOD){
    if(b==0){
        Matrix res(a.size(),Array(a.size()));
        REP(i,a.size())res[i][i]=1;	// �P�ʌ�������I
        return res;
    }
    Matrix res=pow(mul(a,a,MOD),b/2,MOD);
    if(b&1)res=mul(res,a,MOD);
    return res;
}

ll T, n, m;

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    while(cin >> n >> m){
        Matrix matrix(n, Array(n));
        REP(i, n) {
            REP(j, n) {
                cin >> matrix[i][j];
            }
        }
        matrix = pow(matrix, m, MOD);
        ll ans = 0;
        REP(i, n) {
            REP(j, n) {
                ans += matrix[i][j];
            }
        }
        cout << ans % MOD << endl;
    }
    return 0;
}


Measured memory_bytes: 1664