#include <bits/stdc++.h>
using namespace std;

int n, m;

int main() {
	scanf("%d%d", &n, &m);
	vector < vector <int> > ans(n, vector <int> (m));
	int x = 0, y = 0, res = 1; ans[x][y] = 1;
	while (x + 2 < n) {
		x += 2; ++res; ans[x][y] = 1;
	}
	while (y + 2 < m) {
		y += 2; ++res; ans[x][y] = 1;
	}
	if (x != n - 1 || y != m - 1) {
		ans[n - 1][m - 1] = 1; ++res;
	}
	printf("%d\n", res);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			printf("%d%c", ans[i][j], j == m - 1 ? '\n' : ' ');
		}
	}
	return 0;
}