#include <bits/stdc++.h>
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) { x = max(x, y); }
template <typename T> inline void chkmin(T& x, T y) { x = min(x, y); }
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 2e5 + 20, T = 1e5 + 5;
vector <pair <int, int>> ans;
vector <pair <int, int>> v[N];
int n, m;
signed main() {
	cin >> n >> m;
	set <int> s;
	F(i, 1 - m, n - 1) s.insert(i);//, cout << "~ " << i << endl;
	F(i, 2, n + m) {
		int l = max(2 - i, i - 2 * m), r = min(i - 2, 2 * n - i);
		v[r + T].emplace_back(l, i);
		// cout << i << " " << l << " " << r << endl;
		// auto it = s.upper_bound(r);
		// if (it == s.begin()) continue;
		// it--;
		// while (it != s.begin() && (*it % 2 + 2) % 2 != i % 2 && *it >= l) it--;
		// if (*it >= l && (*it % 2 + 2) % 2 == i % 2) {
		// 	// cout << "# " << *it << endl;
		// 	ans.emplace_back(i, *it);
		// 	s.erase(it);
		// }
	}
	F(ii, 1, 2e5 + 10) {
		int i = ii - T;
		sort(all(v[ii]));
		for (auto [a, b]: v[ii]) {
			auto it = s.lower_bound(a);
			while (it != s.end() && (*it % 2 + 2) % 2 != b % 2 && *it <= i) it++;
			if (*it <= b && (*it % 2 + 2) % 2 == b % 2) {
				ans.emplace_back(b, *it);
				s.erase(it);
			}
		}
	}
	cout << ans.size() << endl;
	for (auto [i, j]: ans) cout << (i + j) / 2 << " " << (i - j) / 2 << '\n';
	return 0;
	// F(i, 1, n)
	// 	F(j, 1, m)
	// 		cout << i + j << " " << i - j << endl;// + n - 1 << endl;// + (2 * n - 1) << endl;
	F(i, 2, n + m) {
		cout << i << " -> " << max(2 - i, i - 2 * m) << " " << min(i - 2, 2 * n - i) << endl;
	}
	return 0;
}