#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios ::sync_with_stdio(false);
  cin.tie(0);
  long long n, k;
  cin >> n >> k;
  long long arr[n + 1], temp[n + 1];
  for (long long i = 1; i < n; i++) {
    arr[i] = 1;
  }
  arr[n] = 0;
  vector<long long> ans[k + 1];
  for (long long i = 1; i <= k; i++) {
    pair<long long, long long> pp[n + 1];
    for (long long j = 1; j <= n; j++) {
      temp[j] = arr[j];
      pp[j].first = arr[j], pp[j].second = j;
    }
    sort(pp + 1, pp + n + 1);
    for (long long j = 1; j <= n; j++) {
      long long d = n - j;
      if (temp[j] < d) {
        long long p = d - temp[j];
        long long l = 1, r = n;
        long long res = 0;
        while (l <= r) {
          long long mid = (l + r) / 2;
          if (pp[mid].first <= p) {
            res = mid;
            l = mid + 1;
          } else {
            r = mid - 1;
          }
        }
        arr[j] += pp[res].first;
        ans[i].push_back(pp[res].second);
      } else {
        ans[i].push_back(n);
      }
    }
  }
  for (long long i = 1; i <= k; i++) {
    for (long long x : ans[i]) {
      cout << x << " ";
    }
    cout << "\n";
  }
}
