#include<bits/stdc++.h>
#define fi first
#define se second
//#define int ll
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
int mod = 1e9 + 7, mod2 = 998244353;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const int N = 4e6 + 10, INF = 0x3f3f3f3f;
ll n, m, k;
int qmi(int a, int b) {
	ll res = 1;
	while (b) {
		if (b & 1)res = res * a % mod;
		a = (ll)a * a % mod;
		b >>= 1;
	}
	return res;
}
void solve() {
	cin >> n >> m;
	ll flag = 0;
	if (n < m){
		flag = 1;
		swap(n, m);
	}
	vector<array<ll, 2>>ans;
	if (n != m) {
		for (int i = 1; i <= m; i++) {
			ans.push_back({1, i});
		}
		for (int i = 1; i <= m; i++) {
			ans.push_back({n, i});
		}
		ll l = 1 + ((m) / 2) + 1;
		ll r = (n) - ((m) / 2) - 1;
//		cout << l << " " << r << '\n';
		if(m % 2 == 0) {
			for (int i = l; i <= r; i += 2) {
				ans.push_back({i, m / 2});
				ans.push_back({i, m / 2 + 1});
			}
		} else {
			for (int i = l; i <= r; i ++) {
				ans.push_back({i, m / 2 + 1});
			}
		}
//		if()
	} else {
		for (int i = 1; i < n; i++) {
			ans.push_back({1, i});
		}
		for (int i = 1; i < n; i++) {
			ans.push_back({m, i});
		}
	}
	cout << ans.size() << '\n';
	for (int i = 0; i < ans.size(); i++) {
		if(flag)swap(ans[i][0], ans[i][1]);
		cout << ans[i][0] << " " << ans[i][1] << '\n';
	}
}
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cout << fixed << setprecision(2);
	int T = 1;
//	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}