#include <bits/stdc++.h>
using namespace std;

using ll = long long;

void solve() {
    int n, k;
    cin >> n >> k;
    vector ve(k, vector<int>(n / k));
    int tt = n / k;
    if (tt == 1) {
        for (int i = 0; i < k; i++) {
            ve[i][0] = i;
        }
    } else if (tt & 1) {
        ve[0][0] = 0;
        ve[0][1] = (k >> 1);
        for (int i = 1; i < k; i++) {
            ve[i][0] = (ve[i - 1][0] + 1) % k;
            ve[i][1] = (ve[i - 1][1] + 1) % k;
        }
        int i = 0, t = k - 1;
        while(t >= 0) {
            ve[i][2] = t, t -= 2, i++;
        }
        t = k - 2;
        while(t >= 0) {
            ve[i][2] = t, t -= 2, i++;
        }
        for (int j = 3; j < n / k; j += 2) {
            for (int i = 0; i < k; i++) {
                ve[i][j] = i;
                ve[i][j + 1] = k - i - 1;
            }
        }
    } else {
        for (int j = 0; j < n / k; j += 2) {
            for (int i = 0; i < k; i++) {
                ve[i][j] = i;
                ve[i][j + 1] = k - i - 1;
            }
        }
    }
    for (int i = 0; i < k; i++) {
        for (int j = 0; j < n / k; j++) {
            cout << ve[i][j] + j * k + 1 << ' ';
        }
        cout << '\n';
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}