#include <bits/stdc++.h>
using namespace  std;
typedef long long int ll;
typedef long double ld;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define fi first
#define se second
#define rsz(a,n) a.resize(n)
#define test(t) ll t;cin>>t;while(t--)
#define forn(i,e) for(int i = 0; i < e; i++)
#define forsn(i,s,e) for(int i = s; i < e; i++)
#define rforn(i,s) for(int i = s; i >= 0; i--)
#define rforsn(i,s,e) for(int i = s; i >= e; i--)
#define fillv(a,k) memset(a,k,sizeof(a))
#define filla(a,k,n) memset(a,k,sizeof(a[0])*n)
#define leadzero(a) __builtin_clz(a) //count leading zeros
#define trailzero(a) __builtin_ctz(a) //count trailing zeros
#define bitcount(a) __builtin_popcount(a) // count set bits (add ll)
#define ln cout<<"\n"
#define sp cout<<" "
#define spaceprint(a,i,s,n) {forsn(i,s,n) { cout<<a[i]; sp;}}
#define lineprint(a,i,s,n) {forsn(i,s,n) {cout<<a[i]; ln;}}
#define maxe(a) *max_element(a.begin(),a.end())
#define maxi(a) max_element(a.begin(),a.end())-a.begin()
#define mine(a) *min_element(a.begin(),a.end())
#define mini(a) min_element(a.begin(),a.end())-a.begin()
#define all(c) c.begin(),c.end()
#define trav(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define present(container, element) (container.find(element) != container.end())
#define cpresent(container, element)  (find(all(container),element) != container.end())// check the presence of element
//copy(from_begin, from_end, to_begin); copy function
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<ll,ll> p64;
typedef pair<int,int> p32;
typedef pair<int,p32> p96;
typedef vector<ll> v64;
typedef vector<string> vs;
typedef vector<int> v32;
typedef vector<v32> vv32;
typedef vector<v64> vv64;
typedef vector<p32> vp32;
typedef vector<vp32> vvp32;
typedef map<int,int> m32;
const int LIM = 1e5+5, MOD = 1e9+7;
#define sumv(v) accumulate(all(v),ll(0))
#define productv(v) accumulate(all(v), ll(1), multiplies< ll >())
ll k,n,a[55][55];
ll t[4*200005];
void mult(ll a[55][55],ll b[55][55])
{
    ll temp[55][55];
    ll i,j,k;
    memset(temp,0,sizeof(temp));
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            for(k=0;k<n;k++)
            {
                temp[i][k]=(temp[i][k]+(a[i][j]*b[j][k])%MOD)%MOD;
            }
        }
    }
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
            a[i][j]=temp[i][j];
}
void matrix(ll k)
{
    if(k==0)
    {
        ll i[55][55];
        ll j,k;
        for(j=0;j<n;j++)
            for(k=0;k<n;k++)
            {
                if(k==j)
                {
                    a[k][j]=1;
                }
                else
                {
                    a[k][j]=0;
                }
            }
            return;
    }
    if(k%2==0)
    {
        mult(a,a);
        matrix(k/2);
        return;
    }
    else
    {
        ll i,j,temp[55][55];
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
            {
                temp[i][j]=a[i][j];
            }
        mult(a,a);
        matrix(k/2);
        mult(a,temp);
        return;
    }
}
int main()
{
    cin>>n>>k;
    for(ll i=0;i<n;i++)
        for(ll j=0;j<n;j++)
            cin>>a[i][j];
    ll t[55][55];
    matrix(k);
    ll sum=0;
    for(ll i=0;i<n;i++)
        for(ll j=0;j<n;j++)
            sum=(sum+a[i][j])%MOD;
        cout<<sum;
}


Measured memory_bytes: 1664