import java.io.*;
import java.text.*;
import java.util.*;

public class Main {

    static InputReader sc = new InputReader(System.in);
    static PrintWriter out = new PrintWriter(System.out);

    public static void main(String[] args) throws IOException {
        solver s = new solver();
        int t = 1;
        while (t > 0) {
            s.solve();
            t--;
        }
        out.close();
    }

    static class InputReader {

        public BufferedReader br;
        public StringTokenizer token;

        public InputReader(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream), 32768);
            token = null;
        }

        public String sn() {
            while (token == null || !token.hasMoreTokens()) {
                try {
                    token = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return token.nextToken();
        }

        public int ni() {
            return Integer.parseInt(sn());
        }

        public String snl() throws IOException {
            return br.readLine();
        }

        public long nlo() {
            return Long.parseLong(sn());
        }

        public double nd() {
            return Double.parseDouble(sn());
        }

        public int[] na(int n) {
            int a[] = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = sc.ni();
            return a;
        }

        public long[] nal(int n) {
            long a[] = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = sc.nlo();
            return a;
        }
    }

    static int inf = 5000013;

    static class solver {
        DecimalFormat df = new DecimalFormat("0.00000000");
        long maxi = Integer.MAX_VALUE;
        long mod = (long) (1e9 + 7);
        int n;

        long pro(long a, long b) {
            return (a % mod * b % mod) % mod;
        }

        long add(long a, long b) {
            return (a + b) % mod;
        }

        long[][] mul(long a[][], long b[][]) {
            long c[][] = new long[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    c[i][j] = 0;
                    for (int k = 0; k < n; k++) {
                        c[i][j] = add(c[i][j], pro(a[i][k], b[k][j]));
                    }
                }
            }
            return c;
        }

        long[][] power(long a[][], long k) {
            long res[][] = new long[n][n];
            for (int i = 0; i < n; i++)
                res[i][i] = 1;
            while (k > 0) {
                if (k % 2 != 0)
                    res = mul(res, a);
                a = mul(a, a);
                k /= 2;
            }
            return res;
        }

        void solve() {
            n = sc.ni();
            long k = sc.nlo();
            long g[][] = new long[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++)
                    g[i][j] = sc.ni();
            }
            long ans[][] = power(g, k);
            long total = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++)
                    total = add(total, ans[i][j]);
            }
            out.println(total);
        }
    }
}


Measured memory_bytes: 23892