#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAX = 1e5 + 10, inf = 2e9, mod = 998244353;

vector<pair<int, int>> ans;
int N, M;
void solve() {
    cin >> N >> M;
    int n = N, m = M, x = 1, y = 1;
    while (1) {
        if (n == 0 or m == 0 or x > N or y > M) break;
        if (n < m) {
            if (n == 1) {
                for (int i = y; i <= y + m - 1; ++i) ans.push_back({x, i});
                break;
            }
            for (int i = x; i <= x + n - 1; ++i) ans.push_back({i, y});
            y += n, m -= n;
        } else if (n > m) {
            if (m == 1) {
                for (int i = x; i <= x + n - 1; ++i) ans.push_back({i, y});
                break;
            }
            for (int i = y; i <= y + m - 1; ++i) ans.push_back({x, i});
            x += m, n -= m;
        } else {
            for (int i = x; i <= x + m - 1; ++i) ans.push_back({i, y});
            if (n > 2)
                for (int i = x + 1; i <= x + m - 2; ++i)
                    ans.push_back({i, y + n - 1});
            break;
        }
    }
    cout << ans.size() << "\n";
    // cout << n << ' ' << m << endl;
    for (auto [f, s] : ans) cout << f << ' ' << s << "\n";
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // cout << fixed << setprecision(10);
    // while (cin >> n)
    // int _;cin >> _;while (_ --)
    solve();
    return 0;
}