//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n, m;
vector<vector<ll>> a;
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    a.resize(m);
    rep(i, m)
    {
        a[i].resize(m);
        rep(j, m)
        {
            cin >> a[i][j];
        }
    }
    vector<vector<vector<ll>>> dp(40, vector<vector<ll>>(m, vector<ll>(m,0)));
    rep(i, m)
    {
        rep(j, m) dp[0][j][i] = a[i][j];
    }
    vector<vector<ll>>ans(m,vector<ll>(m,0));
    for (int i = 1; i < 40; i++)
    {
        rep(j, m)
        {
            rep(k, m)
            {
                rep(z, m)
                {
                    chmax(dp[i][j][k], dp[i - 1][j][z]+dp[i-1][z][k]);
                }
            }
        }
    }
    n--;//1回目は遷移ではないです
    int d=0;
    while(n){
        if(n%2){
            vector<vector<ll>> ans2(m, vector<ll>(m, 0));
            rep(i,m){//jからiの遷移
                rep(j,m){
                    rep(k,m){
                        chmax(ans2[i][j],ans[i][k]+dp[d][k][j]);
                    }
                }
            }
            swap(ans,ans2);
        }
        n/=2;
        d++;
    }
    ll ansa=0;
    rep(i,m){
        rep(j,m){
            chmax(ansa,ans[i][j]);
        }
    }
    cout<<ansa<<"\n";
}