#include <bits/stdc++.h>
using namespace std;
//*
#include <atcoder/all>
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
//*/
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
ll mypowl(ll A, ll B) {ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

ll count(const vector<vector<ll>> &A)
{
  ll res = 0;
  for (auto &a : A)
  {
    ll tmp = count(a.begin(), a.end(), 1LL);
    res += tmp;
  }
  return res;
}

int main()
{
  ll H, W;
  cin >> H >> W;
  if (H == 1 || W == 1)
  {
    vector<vector<ll>> A(H, vector<ll>(W, 0));
    cout << 0 << endl;
    printvec2(A);
    return 0;
  }
  vector<vector<ll>> A(H, vector<ll>(W, 1));
  if (H % 2 == 0 && W % 2 == 0)
  {
    cout << count(A) << endl;
    printvec2(A);
  }
  else if (H % 2 == 0 && W % 2 != 0)
  {
    for (ll i = 0; i < H; i++)
    {
      A.at(i).back() = 0;
    }
    cout << count(A) << endl;
    printvec2(A);
  }
  else if (H % 2 != 0 && W % 2 == 0)
  {
    fill(A.back().begin(), A.back().end(), 0LL);
    cout << count(A) << endl;
    printvec2(A);
  }
  else
  {
    for (ll i = 0; i < min(H, W); i++)
    {
      A.at(i).at(i) = 0;
    }
    if (H > W)
    {
      for (ll i = W; i < H; i++)
      {
        A.at(i).back() = 0;
      }
    }
    else
    {
      for (ll j = H; j < W; j++)
      {
        A.back().at(j) = 0;
      }
    }
    
    cout << count(A) << endl;
    printvec2(A);
  }
}