#include <bits/stdc++.h>
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma comment(linker, "/STACK:367077216")
using namespace std;
const long double EPS = 1e-9;
const long double PI = acos(-1);
int mod = (int)998244353;
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int a228 = 18;
const int inf = 1e9;
const long long kekmod = 1791791791;
const long long bestmod = 1148822869;
vector<long long> genarray(long long n) {
  if (n == 1) return {1};
  if (n == 2) return {3, 4};
  if (n % 2 == 1) {
    vector<long long> ans;
    ans.push_back(2);
    for (long long i = 0; i < n - 2; ++i) ans.push_back(1);
    ans.push_back(n / 2 + 1);
    return ans;
  } else {
    vector<long long> ans;
    ans.push_back(2);
    ans.push_back(2);
    for (long long i = 0; i < n - 3; ++i) ans.push_back(1);
    ans.push_back(n / 2 + 2);
    return ans;
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  srand(time(NULL));
  long long n, m;
  cin >> n >> m;
  vector<long long> a = genarray(n);
  vector<long long> b = genarray(m);
  vector<vector<long long>> ans(n, vector<long long>(m));
  for (long long i = 0; i < n; ++i) {
    for (long long j = 0; j < m; ++j) {
      ans[i][j] = a[i] * b[j];
    }
  }
  for (long long i = 0; i < n; ++i) {
    for (long long j = 0; j < m; ++j) {
      cout << ans[i][j] << ' ';
    }
    cout << endl;
  }
}
