#include <bits/stdc++.h>
int a[2][110];
void init(int f, int n) {
  if (n == 1) {
    a[f][0] = 1;
  } else if (n == 2) {
    a[f][0] = 3;
    a[f][1] = 4;
  } else if (n % 2 == 0) {
    for (int i = 0; i < n - 1; i++) a[f][i] = 1;
    a[f][n - 1] = n / 2 - 1;
  } else {
    for (int i = 0; i < n - 2; i++) a[f][i] = 1;
    a[f][n - 2] = 2;
    a[f][n - 1] = n / 2 + 1;
  }
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  init(0, n);
  init(1, m);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      printf("%d", a[0][i] * a[1][j]);
      if (j < m - 1) printf(" ");
    }
    printf("\n");
  }
  return 0;
}
