#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(lint i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint H, W;
	cin >> H >> W;
	vvi v(H, vi(W, 1));

	lint a=H*W, b=0, c=0, x, y, z;
	if (H == 1) {
		rep(j, W) v[0][j] = 0;
		a = 0;
	}
	else if (W == 1) {
		rep(i, W) v[i][0] = 0;
		a = 0;
	}
	else if (H%2 == 1 && W%2 == 1) {
		if (H > W) {
			rep(i, H) {
				v[i][min(H-i-1, W-1)] = 0;
			}
			a -= H;
		} else {
			rep(j, W) {
				v[min(W-j-1, H-1)][j] = 0;
			}
			a -= W;
		}
	}
	else if (H%2 == 1) {
		rep(j, W) v[H-1][j] = 0;
		a -= W;
	}
	else if (W%2 == 1) {
		rep(i, H) v[i][W-1] = 0;
		a -= H;
	}
	std::cout << a << '\n';
	rep(i, H) vout(v[i]);
}