#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long linf = 1000000000000000000LL;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T k) {
  return k >= 0 ? k : -k;
}
template <class T>
T sqr(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
template <class T>
void mode(T &a, T b) {
  a = mod(a, b);
}
template <class T>
void maxe(T &a, T b) {
  a = max(a, b);
}
template <class T>
void mine(T &a, T b) {
  a = min(a, b);
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
int test;
int n, m;
int f[22];
int main() {
  scanf("%d%d", &n, &m);
  f[0] = 1;
  for (int i = 1; i <= m; i++) f[i] = f[i - 1] * 2;
  for (int t = 1; t <= m; t++) {
    for (int i = 1; i < n; i++)
      printf("%d ", (i >= n - f[t - 1]) ? n
                    : (i >= n - f[t])   ? (f[t - 1] + i)
                                        : (n - f[t - 1]));
    printf("%d\n", n);
  }
  return 0;
}
