/*

  "With age, comes wisdom. With travel, comes understanding.
   Remember that happiness is a way of travel – not a destination"

*/

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

using namespace std;
using namespace __gnu_pbds;

#define int            long long int
#define F              first
#define S              second
#define pb             push_back
#define si             set <int>
#define vi             vector <int>
#define pii            pair <int, int>
#define vpi            vector <pii>
#define vpp            vector <pair<int, pii>>
#define mii            map <int, int>
#define mpi            map <pii, int>
#define spi            set <pii>
#define endl           "\n"
#define sz(x)          ((int) x.size())
#define all(p)         p.begin(), p.end()
#define double         long double
#define que_max        priority_queue <int>
#define que_min        priority_queue <int, vi, greater<int>>
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a)       for(auto x : a) cout << x << " "; cout << endl
#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl

inline int power(int a, int b)
{
     int x = 1;
     while (b)
     {
          if (b & 1) x *= a;
          a *= a;
          b >>= 1;
     }
     return x;
}

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

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
     const char* comma = strchr (names + 1, ',');
     cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}

const int N = 200005;
int a[N], n, m, k, mod = 1e9 + 7;

const int M = 51;
struct mat_expo
{
     int m[M][M];

     mat_expo() { memset(m, 0, sizeof m); }
     void eye()
     {
          for (int i = 0; i < M; i++)
               m[i][i] = 1;
     }
     mat_expo operator*(const mat_expo &a) const
     {
          mat_expo r;
          for (int i = 0; i < M; i++)
               for (int j = 0; j < M; j++)
                    for (int k = 0; k < M; k++)
                         r.m[i][j] = (r.m[i][j] + m[i][k] * 1ll * a.m[k][j]) % mod;
          return r;
     }
};
mat_expo getans(mat_expo bb, int k)
{
     mat_expo aa;
     aa.eye();
     while (k)
     {
          if (k & 1) aa = aa * bb;
          bb = bb * bb;
          k /= 2;
     }
     return aa;
}

void solve()
{
     cin >> n >> k;
     mat_expo mat;

     for (int i = 0; i < n; i++)
          for (int j = 0; j < n; j++)
               cin >> mat.m[i][j];

     mat_expo bb = getans(mat, k);
     int ans = 0;
     for (int i = 0; i < n; i++)
          for (int j = 0; j < n; j++)
               ans += bb.m[i][j], ans %= mod;

     cout << ans;

}

int32_t main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

     cout << setprecision(9) << fixed;
     clock_t z = clock();
     solve();
     cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);

     return 0;
}

Measured memory_bytes: 384