#include<iostream>
#include<string.h>
#include<algorithm>
int n, k, map[102][102], d[4][2] = { {1,0},{-1,0},{0,1},{0,-1} },sum[102][102];
using namespace std;
int main()
{
int dfs(int,int);
while (cin >> n >> k&&(n+k)!=-2)
{
memset(sum, 0, sizeof(sum));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> map[i][j];
cout << dfs(0, 0) << endl;
}
return 0;
}
int dfs(int x,int y)
{
if (sum[x][y]) return sum[x][y];
int s = 0;
for (int i = 0; i < 4; i++)
{
for (int j = 1; j <= k; j++)
{
int x1 = x + d[i][0] * j, y1 = y + d[i][1] * j;
if (x1 < 0 || x1 >= n || y1 < 0 || y1 >= n) continue;
if (map[x1][y1] <= map[x][y]) continue;
int ll=dfs(x1, y1);
s = max(ll, s);
}
}
sum[x][y] = s + map[x][y];
return sum[x][y];
}