#include <bits/stdc++.h>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL,LL> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQGI; //大きい順
typedef priority_queue<int, VI, greater<int>> PQLI;
typedef priority_queue<PII> PQGP;
typedef priority_queue<PII, VPII, greater<PII>> PQLP;
//priority_queue<T,vector<T>,decltype(f)> pq{f};

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EB emplace_back
#define EF emplace_front
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define SORTR(c) sort((c).rbegin(), (c).rend())
#define LB lower_bound
#define UB upper_bound
#define NEXP next_permutation
#define FI first
#define SE second
#define Vmin(a) *min_element((a).begin(),(a).end())
#define Vmax(a) *max_element((a).begin(),(a).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define FORR(i,a,b) for(int i = (b-1);i>=(a);i--)
#define REPR(i,n) FORR(i,0,n)
#define CFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define CREP(i,n)  CFOR(i,0,n)
#define CFORR(i,a,b) for(int i = (b);i>=(a);i--)
#define CREPR(i,n) CFORR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int INF = INT_MAX/2;
const LL LINF = LLONG_MAX/3;
const int RINF = INT_MIN/2;
const LL RLINF = LLONG_MIN/3;
const LL MOD = 1e9+7;
const LL MODD = 998244353;
const int MAX = 510000;

inline bool Eq(double a, double b) { return fabs(b - a) < EPS; }

//other
//-------------------------------------------
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 (b<a) { a=b; return 1; } return 0; }

#define COUT(x) cout << (x) << endl
#define COUT2(x,y) cout << (x) << " " << (y) << endl
#define COUT3(x,y,z) cout << (x) << " " << (y) << " " << (z) << endl
#define PR(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
#define BC(x) __builtin_popcountll(x)

VI dx = {1,0,-1,0,1,1,-1,-1};
VI dy = {0,1,0,-1,1,-1,1,-1};

LL Gcd(LL a, LL b) {return __gcd(a,b);}
LL Lcm(LL a, LL b) {return a/Gcd(a,b)*b;}

LL ModPow(LL A, LL N, LL M=MOD){
  LL res = 1;
  while(N>0){
    if(N&1) res = res * A % M;
    A = A * A % M;
    N >>= 1;
  }
  return res;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < SZ(v); i++) {
    os << v[i] << (i + 1 != SZ(v) ? " " : "");
  }
  return os;
}

template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}


template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  
  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
using mint = ModInt< MOD >;
using VM = vector<mint>;
using VVM = vector<VM>;


template<int mod>
struct Matrix{
  using Mint = ModInt<mod>;
  vector<vector<Mint>> val;
  Matrix(int n, int m, Mint x=0): val(n,vector<Mint>(m,x)) {}
  Matrix(vector<vector<Mint>> x): val(x) {}
  void init(int n, int m, Mint x=0) {val.assign(n,vector<Mint>(m,x));}
  size_t size() const {return val.size();}
  inline vector<Mint>& operator[] (int i) {return val[i];}
  inline vector<Mint>& at(int i) {return val.at(i);}
};

template<int mod>
Matrix<mod> operator*(Matrix<mod>A, Matrix<mod>B) {
  Matrix<mod> res(SZ(A), SZ(B.at(0)));
  REP(i, SZ(A))REP(j,SZ(B.at(0)))REP(k,SZ(B)){
    res.at(i).at(j) += A.at(i).at(k)*B.at(k).at(j);
  }
  return res;
}

template<int mod>
Matrix<mod> pow(Matrix<mod>A, LL n){
  int m = SZ(A);
  Matrix<mod> res(m, m);
  REP(i,m) res.at(i).at(i) = 1;
  while(n > 0){
    if(n & 1) res = res*A;
    A = A*A;
    n >>= 1;
  }
  return res;
}

template<int mod>
int GaussJordan(Matrix<mod> &A, bool is_extended = false) {
  int m = SZ(A), n = SZ(A.at(0));
  int rank = 0;
  REP(col, n){
    if(is_extended && col==n-1) break;
    int pivot = -1;
    FOR(row, rank, m){
      if(A.at(row).at(col) != 0){
        pivot = row;
        break;
      }
    }
    if(pivot == -1) continue;
    swap(A.at(pivot), A.at(rank));

    auto inv = A.at(rank).at(col).inverse();
    REP(col2,n) A.at(rank).at(col2) *= inv;

    REP(row,m){
      if(row != rank && A.at(row).at(col)!=0){
        auto fac = A.at(row).at(col);
        REP(col2,n){
          A.at(row).at(col2) -= A.at(rank).at(col2)*fac;
        }
      }
    }
    ++rank;
  }
  return rank;
}
template<int mod>
int linear_equation(Matrix<mod> A, vector<ModInt<mod>> b, vector<ModInt<mod>> &res){
  int m = SZ(A), n = SZ(A.at(0));
  Matrix<mod> M(m, n+1);
  REP(i,m){
    REP(j,n) M.at(i).at(j) = A.at(i).at(j);
    M.at(i).at(n) = b.at(i);
  }
  int rank = GaussJordan(M, true);

  FOR(row, rank, m){
    if(M.at(row).at(n) != 0) return -1;
  }

  res.assign(n,0);
  REP(i,rank) res.at(i) = M.at(i).at(n);
  return rank;
}


int main() {

  // cin.tie(0);
  // ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);

  int N;
  LL K;
  cin >> N >> K;

  Matrix<MOD> mat(N,N);

  REP(i,N)REP(j,N){
    int a; cin >> a;
    mat.at(i).at(j) = a;
  }

  Matrix<MOD> res =pow(mat, K);

  mint ans = 0;

  REP(i,N)REP(j,N){
    ans += res.at(i).at(j);
  }

  COUT(ans);

  return 0;
}

Measured memory_bytes: 3676