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