#include <bits/stdc++.h>
using namespace std;

#define rep(i,f,t) for (int i = f; i < t; i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define trav(a,x) for (auto& a : x)
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;

vector<pii> solve(int R, int C) {
	vector<pii> res;
	for (int r = 1; r <= R; r += C) {
		rep(c,1,C+1) res.emplace_back(r, c);
	}
	int extra = (R - 1) % C;
	extra = 2 * extra - C;
	if (extra > 0) {
		rep(c,(C-extra+2)/2,(C+extra+2)/2) {
			res.emplace_back(R, c);
		}
	}
	return res;
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int R, C;
	cin >> R >> C;

	vector<pii> X = solve(R, C);
	vector<pii> Y = solve(C, R);
	if (Y.size() > X.size()) {
		trav(it, Y) swap(it.first, it.second);
		X = Y;
	}
	cout << X.size() << endl;
	trav(it, X) {
		cout << it.first << " " << it.second << "\n";
	}

}