import java.util.*;
import java.io.*;
import java.text.*;
//Solution Credits: Taranpreet Singh
public class Main{
    //SOLUTION BEGIN
    void pre() throws Exception{}
    void solve(int TC) throws Exception{
        int n = ni();long K = nl();
        long[][] g = new long[n][n];
        for(int i = 0; i< n; i++)for(int j = 0; j< n; j++)g[i][j] = ni();
        long[][] gg = pow(g, K);
        long ans = 0;
        for(int i = 0; i< n; i++)
            for(int j = 0; j< n; j++)
                ans = (ans+gg[i][j])%mod;
        pn(ans);
    }
    long[][] pow(long[][] m, long p) throws Exception{ // m should be square matrix
        long[][] o = new long[m.length][m.length], t = new long[m.length][m.length];
        for(int i = 0; i< m.length; i++)for(int j = 0; j< m.length; j++)t[i][j] = m[i][j];
        for(int i = 0; i< m.length; i++)o[i][i] = 1;
        while(p>0){
            if(p%2==1)o = multiply(o,t);
            t = multiply(t,t);
            p>>=1;
        }
        return o;
    }
    long[][] multiply(long[][] a, long[][] b) throws Exception{
        if(a[0].length!=b.length)throw new Exception();
        long[][] c = new long[a.length][b[0].length];
        for(int i = 0; i< a.length; i++){
            for(int j = 0; j< b[0].length; j++){
                for(int k = 0; k< b.length; k++){
                    long v = (a[i][k]*b[k][j])%mod;
                    c[i][j]+=v;
                    if(c[i][j]>=mod)c[i][j]-=mod;
                }
            }
        }
        return c;
    }
    //SOLUTION END
    void hold()throws Exception{throw new Exception("Hold right there, Sparky!");}
    long mod = (long)1e9+7, IINF = (long)4e18;
    final int INF = (int)2e9, MX = (int)1e6+1;
    DecimalFormat df = new DecimalFormat("0.000000000000000");
    double PI = 3.1415926535897932384626433832792884197169399375105820974944, eps = 1e-8;
    static boolean multipleTC = false, memory = false;
    FastReader in;PrintWriter out;
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        int T = (multipleTC)?ni():1;
        //Solution Credits: Taranpreet Singh
        pre();for(int i = 1; i<= T; i++)solve(i);
        out.flush();
        out.close();
    }
    public static void main(String[] args) throws Exception{
        if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, "1", 1 << 28).start();
        else new Main().run();
    }
    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n(){return in.next();}
    String nln(){return in.nextLine();}
    int ni(){return Integer.parseInt(in.next());}
    long nl(){return Long.parseLong(in.next());}
    double nd(){return Double.parseDouble(in.next());}

    class FastReader{
        BufferedReader br;
        StringTokenizer st;
        public FastReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        String nextLine(){
            String str = "";
            try{   
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }  
            return str;
        }
    }
}    

Measured memory_bytes: 26324