#include <bits/stdc++.h>

using namespace std;

ifstream fin("ferma2.in");
ofstream fout("ferma2.out");

const int nMax = 1005;
int n, k, S;
int sc[nMax][nMax], sl[nMax][nMax], sd[nMax][nMax];

inline void Read()
{
    int x;
    fin >> n >> k;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= i; j++)
        {
            fin >> x;
            S += x;
            sc[i][j] = sc[i - 1][j] + x;
            sl[i][j] = sl[i][j - 1] + x;
            sd[i][j] = sd[i - 1][j - 1] + x;
        }
}

inline void Solve()
{
    int s, L, i, smin, s1, j;
    L = n - k;
    s = 0;
    for(i = 1; i <= L; i++)
        s += sl[i][i];
    smin = s1 = s;
    for(i = 2; i <= k + 1; i++)
    {
        s1 = s = s1 + sl[i + L - 1][L] - sd[i + L - 2][L];
        smin = min(smin, s);
        for(j = 2; j <= i; j++)
        {
            s = s - (sc[i + L - 1][j - 1] - sc[i - 1][j - 1]) + (sd[i + L - 1][j + L - 1] - sd[i - 1][j - 1]);
            smin = min(smin, s);
        }
    }
    fout << S - smin << "\n";
}

int main()
{
    Read();
    Solve();
    fin.close();fout.close();
    return 0;
}