/*...Part - 01...*/

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <iterator>
#include <bitset>
#include <assert.h>
#include <new>
#include <sstream>
//#include <bits/stdc++.h>
using namespace std ;

/*...Part - 02...*/

typedef long long               ll ;
typedef long double             ld ;
typedef unsigned long long      ull ;
typedef pair<int,int>           pii ;
typedef pair<ll,ll>             pll ;
typedef vector<int>             vi ;
typedef vector<ll>              vll ;
typedef vector<vector<int>>     vvi ;

int Int(){int x ; scanf("%d",&x) ; return x ;}
ll Long(){ll x ; scanf("%lld",&x) ; return x ;}

/*...Part - 03...*/
/*....Debugger....*/

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {cout << endl ;}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
    cerr << *it << " = " << a << ' ' ;
    err(++it, args...);
}

/*...Part - 04...*/
/*...Needed to change according to problem requirements...*/

const int N          = (int)2e5 + 5 ;
const int maxN       = (int)1e6 + 6 ;
const ll  Mod        = (ll)1e9 + 7 ;
const int inf        = (int)2e9 ;
const ll  Inf        = (ll)1e18 ;

/*..........................................................*/
/*...Part - 05...*/

#define     debug(x)    cerr << #x << " = " << x << '\n' ;
#define     rep(i,b,e)  for(__typeof(e) i = (b) ; i != (e + 1) - 2 * ((b) > (e))  ; i += 1 - 2 * ((b) > (e)))
#define     Int         Int()
#define     Long        Long()
#define     all(x)      x.begin() , x.end()
#define     sz(x)       (int)x.size()
#define     ff          first
#define     ss          second
#define     pb          push_back
#define     eb          emplace_back
#define     mem(a)      memset(a , 0 ,sizeof a)
#define     memn(a)     memset(a , -1 ,sizeof a)

/*...Part - 06...*/
/*...... ! Code start from here ! ......*/

const int max_n = 52, mod = 1e9 + 7 ;



struct matrix{
	int dp[max_n][max_n];
	matrix(){
		mem(dp) ;
	}
} ;

inline int add(int a, int b){
	a += b ;
	if(a >= mod)a -= mod ;
	return a ;
}

inline int mul(int a, int b){
	ll k = 1LL * a * b ;
	if(k >= mod)k %= mod ;
	return (int)k ;
}

matrix multiply(matrix a, matrix b, int n){
	matrix res ;
	for(int i = 0 ; i < n ; ++i)
		for(int j = 0 ; j < n ; ++j)
			for(int k = 0 ; k < n ; ++k)
				res.dp[i][j] = add(res.dp[i][j], mul(a.dp[i][k], b.dp[k][j])) ;
	return res ;
}

matrix modpow(matrix b, ll p, int n){
	matrix res ;
	for(int i = 0 ; i < n ; ++i)
		for(int j = 0 ; j < n ; ++j)
			res.dp[i][j] = i == j ;
	while(p > 0){
		if(p & 1)res = multiply(res, b, n) ;
		b = multiply(b, b, n) ;
		p /= 2LL ;
	}
	return res ;
}

int main(){
    int test = 1 , tc = 0 ;
    while(test--){
        int n = Int ;
        ll k = Long ;
        matrix b ;
        int cnt = 0 ;
        for(int i = 0 ; i < n ; ++i)
        	for(int j = 0 ; j < n ; ++j)
        		cnt += b.dp[i][j] = Int ;
        if(k == 1)return cout << cnt << '\n', 0 ;
        b = modpow(b, k, n) ;
        cnt = 0 ;
        for(int i = 0 ; i < n ; ++i)
        	for(int j = 0 ; j < n ;++j)
        		cnt = add(cnt, b.dp[i][j]) ;
        cout << cnt << '\n' ;
    }
    return 0 ;
}

/*...Always look at the part - 04...*/
/*...............END................*/




Measured memory_bytes: 256