#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
 
//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if(a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if(a > b) { a = b; return 1; } return 0; }
template<typename A,size_t N,typename T>void Fill(A(&array)[N],const T &val){fill((T*)array, (T*)(array+N), val);}
const int inf = INT_MAX / 2; const ll INF = LLONG_MAX / 2;
//template end

int mod = 1e9+7;
struct Mint {
  int val;
  Mint inv() const {
    int tmp, a = val, b = mod, x = 1, y = 0;
    while(b) tmp = a / b, a -= tmp * b, swap(a, b), x -= tmp * y, swap(x, y);
    return Mint(x);
  }
public:
  Mint() :val(0) {}
  Mint(ll x) :val(x >= 0 ? x % mod : x % mod + mod) {}
  int mtoi() { return this->val; }
  Mint pow(ll t) { Mint res = 1,b = *this; while(t){if(t&1)res *= b;b *= b;t >>= 1;}return res; }
  Mint& operator+=(const Mint& x) { if ((val += x.val) >= mod) val -= mod; return *this; }
  Mint& operator-=(const Mint& x) { if ((val += mod - x.val) >= mod) val -= mod; return *this; }
  Mint& operator*=(const Mint& x) { val = (ll)val * x.val % mod; return *this; }
  Mint& operator/=(const Mint& x) { return *this *= x.inv(); }
  bool operator==(const Mint& x) const { return val == x.val; }
  bool operator!=(const Mint& x) const { return val != x.val; }
  bool operator<(const Mint& x) const { return val < x.val; }
  bool operator<=(const Mint& x) const { return val <= x.val; }
  bool operator>(const Mint& x) const { return val > x.val; }
  bool operator>=(const Mint& x) const { return val >= x.val; }
  Mint operator+(const Mint& x) const { return Mint(*this) += x; }
  Mint operator-(const Mint& x) const { return Mint(*this) -= x; }
  Mint operator*(const Mint& x) const { return Mint(*this) *= x; }
  Mint operator/(const Mint& x) const { return Mint(*this) /= x; }
};
struct factorial {
  vector<Mint> Fact, Finv;
public:
  factorial(int maxx) {
    Fact.resize(maxx+1,Mint(1)),Finv.resize(maxx+1); rep(i,0,maxx)Fact[i+1]=Fact[i]*Mint(i+1);
    Finv[maxx]=Mint(1)/Fact[maxx]; rrep(i,maxx,0)Finv[i-1]=Finv[i]*Mint(i);
  }
  Mint fact(int n,bool inv) { if(inv) return Finv[n]; else return Fact[n]; }
  Mint nPr(int n,int r) { if(n<0||n<r||r<0) return Mint(0); else return Fact[n]*Finv[n-r]; }
  Mint nCr(int n,int r) { if(n<0||n<r||r<0) return Mint(0); else return Fact[n]*Finv[r]*Finv[n-r]; }
};

typedef vector<vector<Mint>> mat;
mat matmul(mat a, mat b) {
  mat ans(a.size(), vector<Mint>(b[0].size(), 0));
  rep(i, 0, a.size())rep(j, 0, b[0].size())rep(k,0,b.size())ans[i][j] += a[i][k]*b[k][j];
  return ans;
}
mat matpow(mat a, ll t) {
  mat ans(a.size());
  rep(i, 0, a.size()) { ans[i].resize(a.size(), 0);ans[i][i] = 1;}
  while (t) {if (t % 2) ans = matmul(ans, a); a = matmul(a, a); t >>= 1;}
  return ans;
}
int gauss(mat &A, bool is_extended = false) {
  int m = A.size(), n = A[0].size(), rank = 0;
  rep(col,0,n) {
    if (is_extended && col == n-1) break;
    int pivot = -1;
    rep(row,rank,m)if (A[row][col].mtoi()) {pivot = row; break;}
    if (pivot == -1) continue;
    swap(A[pivot], A[rank]); Mint inv=A[rank][col];
    rep(col2,0,n)A[rank][col2] /= inv;
    rep(row,0,m)if (row != rank && A[row][col].mtoi()) {
      Mint base=A[row][col];
      rep(col2,0,n) {A[row][col2] -= (A[rank][col2] * base);}
    }
    ++rank;
  }
  return rank;
}
int linear_equation(mat A, vector<ll> b, vector<ll> &res) {
  int m = A.size(), n = A[0].size();
  mat M(m);
  rep(i,0,m){
    M[i].resize(n+1);
    rep(j,0,n) M[i][j] = A[i][j];
    M[i][n] = b[i];
  }
  int rank = gauss(M, true);
  rep(row,rank,m) if (M[row][n].mtoi()) return -1;
  res.resize(n); rep(i,0,rank)res[i] = M[i][n].mtoi();
  return rank;
}
ll bitgauss(vector<bitset<510>> m) {
  ll h = m.size(),w = m[0].size(),now = 0;
  rep(i,0,w){
    ll pivot = -1;
    rep(j,now,h)if (m[j][i]) {pivot = j;break;}
    if (pivot == -1) continue;
    if (pivot != now)swap(m[now], m[pivot]);
    rep(j,now+1,h)if (m[j][i]) m[j]^=m[now];
    now++;
    if (now == h) break;
  }
  return now;
}

int main(){
  int n; ll k; scanf("%d%lld",&n,&k);
  mat a(n);
  rep(i,0,n){
    a[i].resize(n);
    rep(j,0,n)scanf("%d",&a[i][j]);
  }
  mat b=matpow(a,k);
  Mint ans=0;
  rep(i,0,n)rep(j,0,n)ans+=b[i][j];
  printf("%d\n",ans.mtoi());
  return 0;
}


Measured memory_bytes: 256