#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
const int N = 1e6 + 10;
const int M = 131;
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;

void solve() {
	int n, m; cin >> n >> m;
	vector<pair<int, int>> res;
	vector<vector<pair<int, int>>> pos(n + m - 1);
	for(int i = -m + 1; i < n; i++){
		int num1 = max(i, -i), num2 = min(2 * (n - 1) - i, 2 * (m - 1) + i);
		pos[num1].push_back({num2, i});
		//cout << num1 << ' ' << num2 << ' ' << i << '\n';
	}
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
	for(int i = 0; i < n + m - 1; i += 2){
		for(auto v : pos[i]) q.push(v);
		while(!q.empty()){
			auto [a, b] = q.top(); q.pop();
			if(a < i) continue;
			res.push_back({(b + i) / 2 + 1, (i - b) / 2 + 1});
			break;
		}
	}
	while(!q.empty()) q.pop();
	for(int i = 1; i < n + m - 1; i += 2){
		for(auto v : pos[i]) q.push(v);
		while(!q.empty()){
			auto [a, b] = q.top(); q.pop();
			if(a < i) continue;
			res.push_back({(b + i) / 2 + 1, (i - b) / 2 + 1});
			break;
		}
	}
	cout << res.size() << '\n';
	for(auto [x, y] : res) cout << x << ' ' << y << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(12);
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
	return 0 - 0;
}