import java.io.*;
import java.util.*;
import java.math.*;

 
 public class Main{
   static class Pair implements Comparable<Pair>{
   int a;
   int b;
   public Pair(int x,int y){a=x;b=y;}
   public Pair(){}
   public int compareTo(Pair p1){
       if(a == p1.a)
       return b - p1.b;
       return a - p1.a;
   }
 }
static class TrieNode{
  TrieNode[]child;
  int w;
  boolean term;
  TrieNode(){
    child = new TrieNode[26];  
  }
}
  public static int gcd(int a,int b)
  {
    if(a<b)
      return gcd(b,a);
    if(b==0)
      return a;
    return gcd(b,a%b);
    
  }
  //static long ans = 0;
  static long mod = (long)(1e9+7);
   
    public static void main(String[] args) throws Exception {
       new Thread(null, null, "Anshum Gupta", 99999999) {
            public void run() {
                try {
                    solve();
                } catch(Exception e) {
                    e.printStackTrace();
                    System.exit(1);
                }
            }
        }.start();
    }

static long pow(long x,long y){
    if(y == 0)return 1;
    if(y==1)return x;
    long a = pow(x,y/2);
    a = (a*a)%mod;
    if(y%2==0){
        return a;
    }
    return (a*x)%mod;
}
 static void mat_mul(long[][]a,long[][]b){
     long[][]ans = new long[n][n];
     for(int i=0;i<n;i++){
         for(int j=0;j<n;j++){
             for(int l=0;l<n;l++){
           //  ans[i][j] = ( (ans[i][j] + ((a[i][l]*b[l][j])%mod) %mod) + mod)%mod;
           ans[i][j] += (a[i][l]*b[l][j]);
           ans[i][j]%=mod;
             }
         }
     }
     for(int i=0;i<n;i++)
     for(int j=0;j<n;j++)
     a[i][j]=ans[i][j];
 }
static void multiply(long[][]a,long k){
    if(k<=1)return;
    if(k%2==0){
        multiply(a,k/2);
        mat_mul(a,a);
    }
    else{
        long[][]temp = new long[n][n];
        for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        temp[i][j]=a[i][j];
        multiply(a,k/2);
        mat_mul(a,a);
        mat_mul(a,temp);
    }
}
static long mxx;
static int n;
 public static void solve() throws Exception {
   // solve the problem here
   MyScanner s = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out), true);
        int t = 1;
        int tc = 0;
        mxx = (long)(1e18+5);
        while(tc++<t){
            n = s.nextInt();
            
            long k = s.nextLong();
            long[][]a=new long[n][n];
            for(int i=0;i<n;i++){
                for(int j=0;j<n;j++){
                    a[i][j] = s.nextInt();
                }
            }
            if(n==1){
                out.println("0");break;
            }
            multiply(a,k);
            long val = 0;
            for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
            val = (((val+a[i][j])%mod)+mod)%mod;
            out.println(val);
        }
        out.flush();
}
 
     
 
 
 
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
 
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
 
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
 
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt() { return Integer.parseInt(next()); }
        long nextLong() { return Long.parseLong(next()); }
        double nextDouble() { return Double.parseDouble(next()); }
         
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    //--------------------------------------------------------
}


Measured memory_bytes: 26380