#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using loop = int;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(loop (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(loop (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(loop (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(loop (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause") //comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

template<class T> struct matrix {
    int n, m;
    vector<vector<T>> dat;
    matrix(vector<vector<T>> _a) : dat(_a) {
        n = dat.size(), m = dat.front().size();
    }
    matrix(int _n, int _m) : n(_n), m(_m) {
        dat = vec<T>(n, m);
    }
    matrix(){}

    matrix operator*(matrix& a) {
        assert(m == a.n);
        matrix ret = matrix(vec<T>(n, a.m));
        FOR(i, 0, n)FOR(j, 0, a.m)FOR(k, 0, m) {
            (ret[i][j] += dat[i][k] * a[k][j] % mod) %= mod;
        }
        return matrix(ret);
    }

    matrix pow(ll k) {
        assert(n == m);
        matrix ret = matrix(vec<ll>(n, n)), a = dat;
        FOR(i, 0, n)ret[i][i] = 1;
        for (; 0 < k; k >>= 1) {
            if (k & 1)ret = ret * a;
            a = a * a;
        }
        return matrix(ret);
    }

    T sum() {
        ll ret = 0;
        FOR(i, 0, n)FOR(j, 0, m)(ret += dat[i][j]) %= mod;
        return ret;
    }

    vector<T>& operator[](int i) { return dat[i]; }
};

int main() {
    init();

    int n; ll k; cin >> n >> k;
    auto a = vec<ll>(n, n); cin >> a;
    matrix<ll> mat(a);
    mat = mat.pow(k);
    cout << mat.sum() << "\n";
}

Measured memory_bytes: 384