#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[1005][1005], pre[1005][1005] = {0};
void init() {
cin >> n >> k;
}
void solve() {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> a[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
pre[i][j] = pre[i-1][j] + pre[i][j-1] - pre[i-1][j-1] + a[i][j];
int cam = 0;
for (int i = k; i <= n; i++)
for (int j = k; j <= n; j++) {
int sum = pre[i][j] - pre[i-k][j] - pre[i][j-k] + pre[i-k][j-k];
cam = max(cam, sum);
}
cout << cam;
}
int main() {
init();
solve();
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgoKaW50IG4sIGs7CmludCBhWzEwMDVdWzEwMDVdLCBwcmVbMTAwNV1bMTAwNV0gPSB7MH07CnZvaWQgaW5pdCgpIHsKICAgIGNpbiA+PiBuID4+IGs7CgoKCn0KCnZvaWQgc29sdmUoKSB7CiAgICBmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpKyspCiAgICAgICAgZm9yIChpbnQgaiA9IDE7IGogPD0gbjsgaisrKQogICAgICAgICAgICBjaW4gPj4gYVtpXVtqXTsKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IG47IGkrKykKICAgICAgICBmb3IgKGludCBqID0gMTsgaiA8PSBuOyBqKyspCiAgICAgICAgICAgIHByZVtpXVtqXSA9IHByZVtpLTFdW2pdICsgcHJlW2ldW2otMV0gLSBwcmVbaS0xXVtqLTFdICsgYVtpXVtqXTsKCiAgICBpbnQgY2FtID0gMDsKICAgIGZvciAoaW50IGkgPSBrOyBpIDw9IG47IGkrKykKICAgICAgICBmb3IgKGludCBqID0gazsgaiA8PSBuOyBqKyspIHsKICAgICAgICAgICAgaW50IHN1bSA9IHByZVtpXVtqXSAtIHByZVtpLWtdW2pdIC0gcHJlW2ldW2ota10gKyBwcmVbaS1rXVtqLWtdOwogICAgICAgICAgICBjYW0gPSBtYXgoY2FtLCBzdW0pOwogICAgICAgIH0KCiAgICBjb3V0IDw8IGNhbTsKCn0KCmludCBtYWluKCkgewogICAgaW5pdCgpOwogICAgc29sdmUoKTsKICAgIHJldHVybiAwOwp9Cg==