#include <fstream>

using namespace std;

const int MAX_N = 1e3;
int a[MAX_N + 1][MAX_N + 1];
int n, k;

int main() {
    ifstream fin("tablete.in");
    ofstream fout("tablete.out");
    fin >> n >> k;
    if (k % 2 == 0) {
        int cnt = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= k; j++) {
                a[i][j] = cnt;
                cnt++;
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int j = k + 1; j <= n; j++) {
                a[i][j] = cnt;
                cnt++;
            }
        }
    } else {
        int cnt = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= k; j++) {
                a[i][j] = cnt;
                cnt++;
            }
        }
        for (int i = 1; i <= n - 1; i += 2) {
            swap(a[i][k], a[i + 1][1]);
        }
        for (int i = 1; i <= n; i++) {
            for (int j = k + 1; j <= n; j++) {
                a[i][j] = cnt;
                cnt++;
            }
        }
        if (n % 2 == 1) {
            swap(a[n][k], a[1][k + 1]);
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            fout << a[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}