#include <iostream>
#include <vector>
using namespace std;

vector<pair<int, int>> solve(int n, int m) {
	vector<pair<int, int>> v;

	for (int i = 1; i <= n; ++i)
		v.push_back({i, 1});

	for (int i = 1; i <= n; ++i) {
		if (m - 1 + i > n && i - m + 1 < 1)
			v.push_back({i, m});
	}

	if (n % 2 == 0) {
		int mx = m - (n / 2 + 1);
		for (int j = n / 2 + 2; j <= mx; j += 2) {
			v.push_back({n / 2, j});
			v.push_back({n / 2 + 1, j});
		}
	} else {
		int mx = m - (n / 2 + 1);
		for (int j = n / 2 + 2; j <= mx; j += 1) {
			v.push_back({n / 2 + 1, j});
		}
	}

	return v;
}

int main() {
	int n, m;
	cin >> n >> m;

	auto a1 = solve(n, m);
	auto a2 = solve(m, n);

	if (a1.size() < a2.size()) {
		a1.clear();
		for (auto it : a2)
			a1.push_back({it.second, it.first});
	}

	cout << a1.size() << "\n";
	for (auto it : a1)
		cout << it.first << " " << it.second << "\n";

	return 0;
}