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