#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<vector<int>> data(n, vector<int>(m, 1));
	int ans = n * m;
	if ((1 == n % 2) && (m % 2)) {
		if (n <= m) {
			rep(i, n)data[i][i] = 0;
			rep2(i, n, m)data[0][i] = 0;
		}
		else {
			rep(i, m)data[i][i] = 0;
			rep2(i, m, n)data[i][0] = 0;
		}
		ans -= max(n, m);
	}
	else if (1 == n % 2) {
		ans -= m;
		rep(i, m)data[0][i] = 0;
	}
	else if (1 == m % 2) {
		ans -= n;
		rep(i, n)data[i][0] = 0;
	}
	cout << ans << endl;
	rep(i, n) {
		rep(j, m) {
			cout << data[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}