#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define inf 1013161010
#define ninf -1013161010
#define mod 1000000007
#define ll long long
#define lf long double
#define in(x) scanf("%d",&x);
#define sz(x) ((int)x.size())
#define lld l64d
#define rep(i,n) for(i=0;i<n;i++)
#define rrep(i,n) for(i=n-1;i>=0;i--)
#define rep1(i,a,b) for(i=a;i<=b;i++)
#define rrep1(i,a,b) for(i=a;i>=b;i--)
#define stlfor(i,t) for(auto i =t.begin();i!=t.end();i++)
#define fr freopen("x.txt","r",stdin)
#define frc freopen("y.txt","w",stdout)
#define all(x) x.begin(),x.end()
#define set0(x) memset(x,0,sizeof(x))
#define dbg cout<<"yo "<<endl;
#define pset(n) fixed<<showpoint<<setprecision(n)

#define pii pair<int,int>
#define pll pair<ll,ll>
#define min_pq priority_queue<pll, vector<pll>, greater<pll> >
#define vpii vector<pair<int,int> >
#define vll vector<ll>
#define vpll vector<pair<ll,ll> >
#define si set<int>
#define mii map<int,int>
#define umii unordered_map<int,int>
#define vi vector<int>
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
#define modulo %
#define moduloe %=

typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> OST;

ll toint(const string &s) { stringstream ss; ss << s; ll x; ss >> x; return x; }
ll add(ll a, ll b) {a+=b; while(a >= mod) a-= mod; while(a<0) a+= mod;}
ll mul(ll a, ll b) {return (a * 1LL *b % mod);}
string tostring ( ll number ){  stringstream ss; ss<< number; return ss.str();}

const lf pi = 2*acos(0);
const int nn = 500006;
const lf EPS = 0.000000001;

ll gcd(ll a,ll b){return (b==0)? a:gcd(b,a%b); }
void nope(int num = 0){ if(num==0) cout<<"NO"; else cout<<"-1"; exit(0); }

const int N = 50;

void multiply(ll a[N][N], ll b[N][N], ll c[N][N], int m, int n, int q,ll md)
{
    int i,j,k;
    for(i=0;i<m;i++)
    {
        for(j=0;j<q;j++)
        {
            c[i][j]=0;
            for(k=0;k<n;k++)
                c[i][j] += ((a[i][k]*b[k][j])%md);
            c[i][j] %= md;
        }
    }
}

void mat_pow(ll m[N][N],ll a[N][N],ll b,int k,ll md)       // power b of matrix m(order k) is stored in a
{
    int i,j;
    if(b==0)
    {
        rep(i, k)
            a[i][i]=1;
        return;
    }
    else if(b==1)               // for b=0 return identity matrix
    {
        rep(i,k)
            rep(j,k)
                a[i][j]=m[i][j];
        return;
    }

    mat_pow(m,a,b/2,k,md);

    ll res[N][N];
    rep(i,k)
        rep(j,k)
            res[i][j]=a[i][j];

    multiply(res,res,a,k,k,k,md);     // Be careful with variable names as third matrix change in multiply, its name should be d/f from first 2
    if(b&1)
    {
        rep(i,k)
            rep(j,k)
                res[i][j]=a[i][j];
        multiply(res,m,a,k,k,k,md);
    }

    return;
}


int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    ll i,j,n,tt;
    tt=1;
    //cin>>tt;
    while(tt--)
    {
        ll k;
        cin>>n>>k;

        ll a[50][50];
        rep(i, n)
            rep(j, n)
                cin>>a[i][j];

        ll ans[50][50];
        mat_pow(a, ans, k, n, mod);

        ll anss = 0;
        rep(i, n)
        {
            rep(j, n)
            {
                anss+=ans[i][j];
                anss %= mod;
            }
        }
        cout<<anss<<endl;
    }
    return 0;
}

// read the question correctly (is y a vowel? what are the exact constraints?)
// look out for SPECIAL CASES (n=1?) and overflow (ll vs int?)


Measured memory_bytes: 1408