// Slower C++ solution:
#include <iostream>

#include <vector>



using namespace std;



	

struct Matrix{

  static const int maxn = 105;

  long long int A[maxn][maxn];

  int n;

 

  Matrix(int n_): n(n_) {

    for(int i = 0; i < n; ++i)

      for(int j = 0; j < n; ++j)

        A[i][j] = 0;

  }

 

  Matrix operator * (const Matrix& o) const {

    Matrix ret(n);

    for(int i = 0; i < n; ++i)

      for(int j = 0; j < n; ++j)

        for(int k = 0; k < n; ++k){

          long long int c = A[i][k] * o.A[k][j] % 1000000007;

          ret.A[i][j] = (ret.A[i][j] + c) % 1000000007;

        }

    return ret;

  }

 

  static Matrix identity(int n){

    Matrix ret(n);

    for(int i = 0; i < n; ++i)

      ret.A[i][i] = 1;

    return ret;

  }

 

  Matrix operator ^ (long long k) const {

    Matrix ret = identity(n);

    Matrix a = *this;

    while(k){

      if(k & 1)ret = ret * a;

      a = a * a;

      k /= 2;

    }

    return ret;

  }

 

};



int main(void) {

    long long int N, K;

    cin >> N >> K;

    Matrix matrix(N);

    for(int i=0; i<N; i++) {

        for(int j=0; j<N; j++) {

            cin >> matrix.A[i][j];

        }

    }

    // for(int k=0; k<K-1; k++) {

    //     Matrix matrix_tmp(N, vector<int>(N));

    //     for(int i=0; i<N; i++) {

    //         for(int j=0; j<N; j++) {

    //             for(int l=0; l<N; l++) {

    //                 matrix_tmp[i][j] += matrix[i][l] *matrix[l][j];

    //             }

    //         }

    //     }

    //     matrix = matrix_tmp;

    // }

    // for(int i=0; i<N; i++) {

    //     for(int j=0; j<N; j++) {

    //         cout << matrix[i][j] << " ";

    //     }

    //     cout << endl;

    // }

    matrix = matrix^(K);

    int ans = 0;

    for(int i=0; i<N; i++) {

        for(int j=0; j<N; j++) {

            ans = (ans + matrix.A[i][j]) % 1000000007;

        }

    }

    cout << ans << endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.8910133772558546x):


/**

    And in the end, the love you take is equal to the love you make.



        I LOVE YOU LAURA.

**/



#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

#include <ext/rope>



#define _CRT_SECURE_NO_DEPRECATE

#define _CRT_DISABLE_PERFCRIT_LOCKS



#define findOrder find_by_order

#define orderKey order_of_key



#define isOn(mask, i) (mask & (1 << i))

#define turn(mask, i) (mask |= (1 << i))

#define switch(mask, i) (mask &= ~(1 << i))

#define change(mask, i) (mask ^= (1 << i))

#define lowbit(mask) (mask & (-mask))

#define turnAll(mask, n) (mask = (1 << n) - 1)

#define switchLastBit(mask) (mask & (mask - 1))

#define turnLastZero(mask) (mask | (mask + 1))

#define modulo(x, mod) ((x) & (mod - 1))

#define log2(x) (31 - __builtin_clz(x))



#define mkp make_pair

#define pb push_back

#define pf push_front

#define eb emplace_back

#define ef emplace_front

#define ins insert

#define rsz resize

#define f first

#define s second

#define lb lower_bound

#define ub upper_bound



#define sz(x) ((int)x.size())

#define all(x) begin(x), end(x)

#define rall(x) rbegin(x), rend(x)



#define debug(x) (cerr << x << " ")



using namespace std;

using namespace __gnu_pbds;

using namespace __gnu_cxx;



typedef double db;

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;



typedef pair<int, int> ii;

typedef pair<ll,ll> pll;

typedef pair<ld,ld> pdb;

typedef pair<int, ii> tri;

typedef complex<ld> cd;



typedef vector<int> vi;

typedef vector<ii> vii;

typedef vector<ld> vdb;

typedef vector<cd> vcd;

typedef vector<ll> vll;

typedef vector<string> vs;

typedef vector<vll> matrix;



typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_tree;



const ll mod = 1e9+7;

const int maxn = 2e5+2;

const int pi = 2 * acos(0.0);

const db eps = 1e-9;



matrix Identity (int n){

    matrix A(n, vll(n));



    for (int i = 0; i < n; i++) A[i][i] = 1LL;

    return A;

}



matrix mult (const matrix &A, const matrix &B){

    matrix C(sz(A), vll(sz(B[0])));

    for (int i = 0; i < sz(C); i++){

        for (int j = 0; j < sz(C[i]); j++){

            for (int k = 0; k < sz(A[i]); k++){

                ll tmp = (A[i][k] * B[k][j]) % mod;

                C[i][j] = (C[i][j] + tmp) % mod;

            }

        }

    }

    return C;

}



matrix qpow (const matrix &A, ll e){

    if (!e) return Identity(sz(A));

    if (e & 1) return mult(A, qpow(A, e - 1));

    return qpow(mult(A, A), e >> 1);

}



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    ll n, k; cin >> n >> k;



    matrix graph(n, vll(n));



    for (int i = 0; i < n; i++){

        for (int j = 0; j < n; j++){

            cin >> graph[i][j];

        }

    }



    matrix ans = qpow(graph, k);



    ll a = 0;

    for (int i = 0; i < n; i++){

        for (int j = 0; j < n; j++){

            a = (a +  ans[i][j]) % mod;

            //cout << ans[i][j] << " ";

        }//cout << "\n";

    }



    cout << a << "\n";



    return 0;

}