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

typedef long long ll;

const ll mod = 998244353;

struct node {
	ll x, y;
} ans[400100];

ll n, m, t;

inline void work() {
	printf("%lld\n", t);
	for (ll i = 1; i <= t; i++) {
		printf("%lld %lld\n", ans[i].x, ans[i].y);
	}
	return;
}

int main() {
	scanf("%lld%lld", &n, &m);
	if (n == 1 && m == 1) {
		printf("1\n");
		printf("1 1\n");
		return 0;
	}
	if (n == m) {
		for (ll i = 1; i < n; i++) {
			t++;
			ans[t].x = 1;
			ans[t].y = i;
			t++;
			ans[t].x = n;
			ans[t].y = i;
		}
		work();
		return 0;
	}
	if (n < m) {
		for (ll i = 1; i <= n; i++) {
			t++;
			ans[t].x = i;
			ans[t].y = 1;
			t++;
			ans[t].x = i;
			ans[t].y = m;
		}
		if (n & 1) {
			for (ll i = 1; i <= m - n - 1; i++) {
				t++;
				ans[t].x = (n + 1) / 2;
				ans[t].y = i + (n + 1) / 2;
			}
		} else {
			if (m & 1) {
				for (ll i = n / 2 + 2; i <= m - n / 2 - 1; i += 2) {
					t++;
					ans[t].x = n / 2;
					ans[t].y = i;
					t++;
					ans[t].x = n / 2 + 1;
					ans[t].y = i;
				}
			} else {
				for (ll i = n / 2 + 2; i >= m - n / 2 - 1; i++) {
					t++;
					ans[t].x = n / 2;
					ans[t].y = i;
				}
			}
		}
	} else {
		for (ll i = 1; i <= m; i++) {
			t++;
			ans[t].x = 1;
			ans[t].y = i;
			t++;
			ans[t].x = n;
			ans[t].y = i;
		}
		if (m & 1) {
			for (ll i = 1; i <= n - m - 1; i++) {
				t++;
				ans[t].x = i + (m + 1) / 2;
				ans[t].y = (m + 1) / 2;
			}
		} else {
			if (n & 1) {
				for (ll i = m / 2 + 2; i <= n - m / 2 - 1; i += 2) {
					t++;
					ans[t].x = i;
					ans[t].y = m / 2;
					t++;
					ans[t].x = i;
					ans[t].y = m / 2 + 1;
				}
			} else {
				for (ll i = m / 2 + 2; i >= n - m / 2 - 1; i++) {
					t++;
					ans[t].x = i;
					ans[t].y = m / 2;
				}
			}
		}
	}
	work(); 
	return 0;
}