#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1005;
int a[N][N], r[N * 2][N * 2], p[N * 2][N * 2], res[N][N];
int sum(int x1, int y1, int x2, int y2) {
    if(x1 > x2 or y1 > y2) return 0;
    return p[x2][y2] - p[x1 - 1][y2] - p[x2][y1 - 1] + p[x1 - 1][y1 - 1];
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, k; cin >> n >> k;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++) {
            cin >> a[i][j];
            int x = i + j, y = i - j + n;
            r[x][y] = a[i][j];
        }
    int z = 2 * n + 1;
    for(int i = 1; i <= z; i ++)
        for(int j = 1; j <= z; j ++)
            p[i][j] = r[i][j] + p[i - 1][j] + p[i][j - 1] - p[i - 1][j - 1];
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++) {
            int x = i + j, y = i - j + n;
            int x1 = max(1LL, x - k);
            int y1 = max(1LL, y - k);
            int x2 = min(z, x + k);
            int y2 = min(z, y + k);
            res[i][j] = sum(x1, y1, x2, y2);
        }
    for(int i = 1; i <= n; i ++) {
        for(int j = 1; j <= n; j ++)
            cout << res[i][j] << " ";
        cout << "\n";
    }
}