#include<bits/stdc++.h>
using namespace std;
#define time chrono::system_clock::now().time_since_epoch().count()
mt19937_64 rnd(time);
#define maxn 1000005
#define int long long

int read() {int x;cin>>x;return x;}

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

	int n = read(), m = read(), op = 0;
	if(n > m) swap(n, m), op = 1;
	vector<pair<int,int>>ans;
	if(n == 1) {
		for(int i = 1; i <= m; i++) {
			ans.push_back({i, 1});
		}
		cout << ans.size() << "\n";
		for(auto [x, y]:ans) {
			if(!op) cout << y << " " << x <<"\n";
			else cout << x << " " << y <<"\n";
		}
		return 0;
	}
	vector<int>vis(n + m + n + m), vis1 = vis;
	for(int i = 1; i <= n; i++) {
		if(vis[1 - i + n] == 0 && vis1[1 + i] == 0) {
			vis[1 - i + n] = 1;
			vis1[1 + i] = 1;
			ans.push_back({i, 1});
		}
	}
	for(int i = 1; i <= n; i++) {
		if(vis[m - i + n] == 0 && vis1[m + i] == 0) {
			vis[m - i + n] = 1;
			vis1[m + i] = 1;
			ans.push_back({i, m});
		}
	}
	for(int i = (n + 1) / 2; i <= n / 2 + 1; i++) {
		for(int j = 1; j <= m; j++) {
			if(!vis[j - i + n] && !vis1[i + j]) {
				vis[j - i + n] = 1;
				vis1[i + j] = 1;
				ans.push_back({i, j});
			}
		}
	}
	cout << ans.size() << "\n";
	for(auto [x, y]:ans) {
		if(op) cout << y << " " << x <<"\n";
		else cout << x << " " << y <<"\n";
	}
}