#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;


int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int n, m;
	cin >> n >> m;
	vector<vector<int>> res(n, vector<int> (m, 0));

	pair<int, int> at = {0, 0};

	res[0][0] = 1;
	int sum = 1;

	while (at != (pair<int, int>){n - 1, m - 1}) {
		if (at.first + 2 < n) {
			at.first += 2;
		} else if (at.first + 1 < n) {
			at.first += 1;
			at.second = min(m - 1, at.second + 1);
		} else {
			at.second = min(m - 1, at.second + 2);
		}
		res[at.first][at.second] += 1;
		sum++;
	}

	cout << sum << '\n';
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			cout << res[i][j] << ' ';

		}
		cout << '\n';
	}
	cout << '\n';
	
	return 0;
}