#include <bits/stdc++.h>
using namespace std;
using DO = double;
using LL = long long;
using VI = vector<int>;
using pii = pair<int, int>;
const int mod = 1e9 + 7;
int power(int a, int b, int c = mod) {
  int ans = 1;
  for (; b; b >>= 1, a = (LL)a * a % c) {
    if (b & 1) ans = (LL)ans * a % c;
  }
  return ans;
}
int a[111][111];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  if (n == 1) {
    if (m == 2) {
      puts("3 4");
      return 0;
    }
    if (m == 1) {
      puts("1");
      return 0;
    }
    if (m % 2)
      a[1][m - 1] = 2;
    else
      a[1][m - 1] = 1;
    for (int i = 1; i < m - 1; i++) a[1][i] = 1;
    int s = m - 1;
    if (s % 2 == 0) s += 3;
    s /= 2;
    a[1][m] = s;
    for (int i = 1; i <= m; i++) cout << a[1][i] << ' ';
    return 0;
  }
  if (n == 2) {
    if (m == 2) {
      puts("3 4");
      puts("4 3");
      return 0;
    }
    if (m == 1) {
      puts("3\n4");
      return 0;
    }
    if (m % 2)
      a[1][m - 1] = 2;
    else
      a[1][m - 1] = 1;
    for (int i = 1; i < m - 1; i++) a[1][i] = 1;
    int s = m - 1;
    if (s % 2 == 0) s += 3;
    s /= 2;
    a[1][m] = s;
    for (int i = 1; i <= m; i++) cout << a[1][i] * 3 << ' ';
    cout << endl;
    for (int i = 1; i <= m; i++) cout << a[1][i] * 4 << ' ';
    return 0;
  }
  if (m == 2) {
    if (n % 2)
      a[n - 1][1] = 2;
    else
      a[n - 1][1] = 1;
    for (int i = 1; i < n - 1; i++) a[i][1] = 1;
    int s = n - 1;
    if (s % 2 == 0) s += 3;
    s /= 2;
    a[n][1] = s;
    for (int i = 1; i <= n; i++)
      cout << a[i][1] * 3 << ' ' << a[i][1] * 4 << endl;
    return 0;
  }
  if (n % 2)
    a[n - 1][1] = 2;
  else
    a[n - 1][1] = 1;
  for (int i = 1; i < n - 1; i++) a[i][1] = 1;
  int s = n - 1;
  if (s % 2 == 0) s += 3;
  s /= 2;
  a[n][1] = s;
  if (m == 1) {
    for (int i = 1; i <= n; i++) cout << a[i][1] << endl;
    return 0;
  }
  if (m % 2)
    a[1][m - 1] = 2;
  else
    a[1][m - 1] = 1;
  for (int i = 1; i < m - 1; i++) a[1][i] = 1;
  s = m - 1;
  if (s % 2 == 0) s += 3;
  s /= 2;
  a[1][m] = s;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) printf("%d ", a[i][1] * a[1][j]);
    puts("");
  }
  return 0;
}
