#include <bits/stdc++.h>
using namespace std;
const int nm = 102;
int m, n;
int a[nm], b[nm];
void tao(int *a, int n) {
  if (n == 1) {
    a[1] = 1;
    return;
  }
  if (n == 2) {
    a[1] = 3;
    a[2] = 4;
    return;
  }
  int i;
  if (n % 2) {
    a[1] = 2;
    for (i = 2; i < n; ++i) a[i] = 1;
    a[n] = (n + 1) / 2;
    return;
  }
  for (i = 1; i < n; ++i) a[i] = 1;
  a[n] = (n - 2) / 2;
}
int main() {
  scanf("%d%d", &m, &n);
  int i, j;
  tao(a, m);
  tao(b, n);
  for (i = 1; i <= m; ++i) {
    for (j = 1; j <= n; ++j) printf("%d ", a[i] * b[j]);
    printf("\n");
  }
}
