#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e2 + 5;
int a[N][N], dp[N][N][N], n, m;
signed main() {
	cin >> n >> m;

//	memset(dp,128,sizeof(dp));
//删掉上面这一行80分，初始化的话样例都过不了
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= i; ++j)
			cin >> a[i][j];
	}
	dp[1][1][0] = a[1][1];
	dp[1][1][1] = a[1][1] * 3;
	for (int k = 0; k <= m; ++k) {
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= i; ++j) {
				if (k == 0) dp[i][j][k] = max(dp[i - 1][j][k] + a[i][j], dp[i - 1][j - 1][k] + a[i][j]);
				else dp[i][j][k] = max(dp[i - 1][j][k] + a[i][j], max(dp[i - 1][j - 1][k] + a[i][j], max(dp[i - 1][j - 1][k - 1] + a[i][j] * 3, dp[i - 1][j][k - 1] + a[i][j] * 3)));
			}
		}
	}
	int k = -99999999999999;
	for (int i = 1; i <= n; ++i) k = max(k, dp[n][i][m]);
	cout << k;
	return 0;
}