#include<bits/stdc++.h>

int main() {
	using namespace std;
	cin.tie(nullptr)->sync_with_stdio(false);
	int N, M; cin >> N >> M;

	vector<vector<int>> A(N, vector<int>(M));

	if (N < M) {
		A[0][M-1] = 1;
		for (int i = 0; i < N; ++i) A[i][i] = 1;
		for (int i = 0; i < M-N-1; ++i) A[0][i+N+1] = (i % 2 == 0);
	} else {
		A[N-1][0] = (N > M);
		for (int i = 0; i < M; ++i) A[i][i] = 1;
		for (int i = 0; i < N-M-1; ++i) A[i+M+1][0] = (i % 2 == 0);
	}

	int S = 0;
	for (int i = 0; i < N; ++i) S += accumulate(A[i].begin(), A[i].end(), 0);

	cout << S << '\n';
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < M; ++j) {
			cout << A[i][j] << ' ';
		}
		cout << '\n';
	}
}