import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop, core.thread;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable MO = 10L^^9 + 7;

int N;
long K;
long[][] A;

long[][] multiply(long[][] a, long[][] b) {
  auto c = new long[][](N, N);
  foreach (u; 0 .. N) foreach (w; 0 .. N) foreach (v; 0 .. N) {
    (c[u][v] += a[u][w] * b[w][v]) %= MO;
  }
  return c;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      K = readLong();
      A = new long[][](N, N);
      foreach (u; 0 .. N) foreach (v; 0 .. N) {
        A[u][v] = readLong();
      }
      auto x = new long[][](N, N);
      auto y = new long[][](N, N);
      foreach (u; 0 .. N) foreach (v; 0 .. N) {
        x[u][v] = A[u][v];
        y[u][v] = (u == v) ? 1 : 0;
      }
      for (long k = K; k; k >>= 1) {
        if (k & 1) {
          y = multiply(y, x);
        }
        x = multiply(x, x);
      }
      long ans;
      foreach (u; 0 .. N) foreach (v; 0 .. N) {
        (ans += y[u][v]) %= MO;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
