#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w;
  cin >> h >> w;
  VVI a(h, VI(w));
  if (h % 2 == 0 || w % 2 == 0) {
    int h2 = h / 2 * 2;
    int w2 = w / 2 * 2;
    rep(i, h2) rep(j, w2) a[i][j] = 1;
  } else {
    rep(i, h) rep(j, w) a[i][j] = 1;
    rep(i, min(h, w)) a[i][i] = 0;
    if (h > w) {
      for(int i = w; i < h; i++) a[i][w - 1] = 0;
    } else {
      for(int j = h; j < w; j++) a[h - 1][j] = 0;
    }
  }
  int cnt = 0;
  rep(i, h) cnt += accumulate(all(a[i]), 0);
  cout << cnt << '\n';
  rep(i, h) rep(j, w) cout << a[i][j] << " \n"[j + 1 == w];
}