#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define uint unsigned int
#define FOR(i,n,m) for(int i=(n);i<=(m);i++)
#define ROF(i,n,m) for(int i=(n);i>=(m);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define SZ(v) v.size()
#define PII pair<int, int>
#define FI(v) v.first
#define SE(v) v.second
#define endl '\n'
template < typename A, typename B >
inline bool chmax(A &x, B y) { return (x < y ? (x = y, true) : false); }
template < typename A, typename B >
inline bool chmin(A &x, B y) { return (x > y ? (x = y, true) : false); }
int n, m;
void solve() {
	cin >> n >> m;
	vector<PII> ans;
	if(n == m) {
		FOR(i, 1, n) ans.push_back({i, 1});
		FOR(i, 2, n - 1) ans.push_back({i, n});
	}
	if(n < m) {
		FOR(i, 1, n) ans.push_back({i, 1});
		FOR(i, 1, n) ans.push_back({i, m});
		if(n & 1) {
			FOR(i, n / 2 + 2, m - n / 2 - 1) 
				ans.push_back({n / 2 + 1, i});
		}
		else {
			for(int i = n / 2 + 2; i <= m - n / 2 - 1; i += 2)
				ans.push_back({n / 2, i});
			for(int i = n / 2 + 2; i <= m - n / 2 - 1; i += 2)
				ans.push_back({n / 2 + 1, i});
		}
	}
	if(n > m) {
		FOR(i, 1, m) ans.push_back({1, i});
		FOR(i, 1, m) ans.push_back({n, i});
		if(m & 1) {
			FOR(i, m / 2 + 2, n - m / 2 - 1) 
				ans.push_back({i, m / 2 + 1});
		}
		else {
			for(int i = m / 2 + 2; i <= n - m / 2 - 1; i += 2)
				ans.push_back({i, m / 2});
			for(int i = m / 2 + 2; i <= n - m / 2 - 1; i += 2)
				ans.push_back({i, m / 2 + 1});
		}
	}
	cout << SZ(ans) << endl;
	for(auto h : ans) cout << FI(h) << " " << SE(h) << endl;
}
int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	solve();
	return 0;
}