#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
double far(double x) { return x - (int)x; }
double fabs(double x) { return x < 0 ? -x : x; }
int N, M, a[1010], b[1010];
bool flag;
void Dfs(int x);
int main() {
  scanf("%d%d", &N, &M);
  swap(N, M);
  flag = 0;
  Dfs(1);
  for (int i = 1; i <= N; ++i) b[i] = a[i];
  swap(N, M);
  flag = 0;
  Dfs(1);
  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;
}
void Dfs(int x) {
  if (x == N + 1) {
    long long sum = 0;
    for (int i = 1; i <= N; ++i) sum += (long long)a[i] * a[i];
    double sq_sum = sqrt((double)sum);
    int fuck = sq_sum;
    sq_sum -= (double)fuck;
    if (fabs(sq_sum) < eps) flag = 1;
    return;
  }
  for (int i = 1; i <= 1000; ++i) {
    a[x] = i;
    Dfs(x + 1);
    if (flag) return;
  }
}
