#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
   int tt = 1;
   //cin >> tt;
   while (tt--) {
		int n, m;
		cin >> n >> m;
		int sw = 0;
		if (n == m) {
			if (n == 1) {
				cout << "1 1" << "\n";
				return 0;
			}
			cout << n + m - 2 << "\n";
			for (int i = 1;i <= n - 1;i++) {
				cout << 1 << " " << i << "\n";
				cout << n << " " << i << "\n";
			}
			return 0;
		}
		if (n < m) {
			swap(n, m);
			sw = 1;
		}
		//m je manja kord
		if (m % 2 == 1) {
			vector<pair<int, int>> res;
			for (int i = 1;i <= m;i++) {
				res.push_back({1, i});
				res.push_back({n, i});
			}
			int s = m - (m / 2 - 1);
			int e = n - (m - (m / 2 - 1)) + 1;
			for (int i = s;i <= e;i++) 
				res.push_back({i, (n + 1) / 2});
			cout << res.size() << '\n';
			if (sw) {
				for (int i = 0;i < (int)res.size();i++)
					swap(res[i].f, res[i].s);
			}
			for (auto x : res)
				cout << x.f << " " << x.s << "\n";
			return 0;
		}
		vector<pair<int, int>> res;
		for (int i = 1;i <= m;i++) 
			res.push_back({1, i});
   	for (int i = 1;i <= m;i++) 
   		res.push_back({n, i});
   	int s = m / 2 + 2, e = n - (m / 2 + 2) + 1;
   	for (int i = s;i <= e;i += 2) {
   		res.push_back({i, m / 2});
   		res.push_back({i, m / 2 + 1});
   	}
   	if(sw) {
        	for(int i = 0; i < res.size(); i++) {
            swap(res[i].first, res[i].second);
        	}
    	}
    	cout << res.size() << "\n";
    	for(auto x : res) 
    		cout << x.f << " " << x.s << "\n";
	}
	return 0;
}