#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n, m; cin >> n >> m;
	vector<pair<int, int>> ans;
	if (min(n, m) == 1) {
		for (int i = 1; i <= max(n, m); i++)
			ans.emplace_back(1, i);
	} else if (m == n) {
		if (m % 2 == 0) {
			for (int i = 1; i < m; i++)
				ans.emplace_back(1, i), ans.emplace_back(n, i);
		} else {
			for (int i = 2; i < m; i++)
				ans.emplace_back(1, i), ans.emplace_back(n, i);
			ans.emplace_back(1, 1);
			ans.emplace_back(1, m);
		}
	} else if (min(n, m) % 2 == 0) {
		int mm = m, nn = n;
		if (m > n) swap(n, m);
		for (int i = 1; i <= m; i++)
			ans.emplace_back(1, i), ans.emplace_back(n, i);
		for (int r = m / 2 + 2; r <= n - m / 2 - 1; r += 2)
			ans.emplace_back(r, m / 2), ans.emplace_back(r, m / 2 + 1);
		m = mm, n = nn;
	} else if (min(n, m) % 2 == 1) {
		int mm = m, nn = n;
		if (m > n) swap(n, m);
		for (int i = 1; i <= m; i++)
			ans.emplace_back(1, i), ans.emplace_back(n, i);
		for (int r = m / 2 + 2; r <= n - m / 2 - 1; r++)
			ans.emplace_back(r, m / 2 + 1);
		m = mm, n = nn;
	}
	cout << sz(ans) << "\n";
	for (auto [x, y]: ans) {
		if (m > n) swap(x, y);
		cout << x << " " << y << "\n";
	}
}