/* -*- coding: utf-8 -*-
 *
 * 1988.cc:  No.1988 Divisor Tiling - yukicoder
 */

#include<cstdio>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_M = 10000;

/* typedef */

/* global variables */

int as[MAX_M];

/* subroutines */

/* main */

int main() {
  // perfect number = 2^(k-1)*(2^k-1)
  //    6: k=2
  //   28: k=3
  //  496: k=5
  // 8128: k=7

  int n, h;
  scanf("%d%d", &n, &h);
  int w = n / h;

  int k = (n == 6) ? 2 : (n == 28) ? 3 : (n == 496) ? 5 : 7;
  int f = (1 << k) - 1;
  //printf("k=%d, f=%d\n", k, f);

  int m = 0;
  for (int j = 0, ej = 1; j < k; j++, ej *= 2) {
    int a = ej;
    for (int l = 0; l < a; l++) as[m++] = a;
  }
  for (int j = 0, ej = 1; j < k - 1; j++, ej *= 2) {
    int a = ej * f;
    for (int l = 0; l < a; l++) as[m++] = a;
  }
  //for (int i = 0; i < n; i++) printf("%d ", as[i]); putchar('\n');

  if (w % f == 0)
    for (int y = 0; y < h; y++)
      for (int x = 0; x < w; x++)
	printf("%d%c", as[y * w + x], (x + 1 < w) ? ' ' : '\n');
  else
    for (int y = 0; y < h; y++)
      for (int x = 0; x < w; x++)
	printf("%d%c", as[x * h + y], (x + 1 < w) ? ' ' : '\n');

  return 0;
}