#include <bits/stdc++.h>
using namespace std;
vector<int> solve(int n) {
  vector<int> v(n, 1);
  if (n == 1) return v;
  if (n == 2) {
    v[0] = 3, v[1] = 4;
    return v;
  }
  int k = n - 1;
  if (k & 1) {
    int p = k >> 1;
    v[n - 1] = p;
  } else {
    k = k - 1 + 4;
    int p = k >> 1;
    v[n - 2] = 2, v[n - 1] = p;
  }
  return v;
}
int main() {
  int n, m;
  while (cin >> n >> m) {
    vector<int> v1 = solve(n), v2 = solve(m);
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++)
        printf("%d%c", v1[i] * v2[j], j + 1 == m ? 10 : 32);
  }
}
