#include <bits/stdc++.h>

#define el '\n'

typedef long long ll;
typedef long double ld;

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 100 + 5;

int a[N][N];

void solveZig(int n) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i & 1)
                a[i][j] = (i + 1) * n - j;
            else
                a[i][j] = i * n + j + 1;
        }
    }
}

void solveSpiral(int n) {
    int c = 1, t = 0;
    while (c <= n * n) {
        for (int j = t; j < n - t; j++)
            a[t][j] = c++;

        for (int i = t + 1; i < n - t; i++)
            a[i][n - t - 1] = c++;

        for (int j = n - t - 2; j >= t; j--)
            a[n - t - 1][j] = c++;

        for (int i = n - t - 2; i > t; i--)
            a[i][t] = c++;

        t++;
    }
}

void testCase() {
    int n, t;
    cin >> n >> t;

    if (t <= 2)
        solveZig(n);
    else
        solveSpiral(n);

    if (t & 1) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++)
                cout << a[i][j] << ' ';

            cout << el;
        }
    }
    else {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++)
                cout << a[j][i] << ' ';

            cout << el;
        }
    }
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();

    return 0;
}