#include <bits/stdc++.h>

#define lsb(x) (x & (-x))

using ull = unsigned long long;
using ll = long long;

using namespace std;

struct Solution {
    vector<pair<int, int>> v;
};

Solution Solve(int n, int m) {
    Solution s;
    for (int i = 1; i <= n; i++) {
        s.v.push_back({i, 1});
    }

    int lastCol = 1;
    while (lastCol <= m) {
        if (lastCol + n > m) {
            if (n % 2 == 0) {
                if (m > lastCol + n / 2) {
                    int cnt = 2 * (m - (lastCol + n / 2));
                    for (int i = n / 2 - cnt / 2 + 1; i <= n / 2 + cnt / 2; i++) {
                        s.v.push_back({i, m});
                    }
                }
            } else {
                if (m > lastCol + n / 2 + 1) {
                    int cnt = 2 * (m - (lastCol + n / 2)) - 1;
                    for (int i = (n + 1) / 2 - cnt / 2; i <= (n + 1) / 2 + cnt / 2; i++) {
                        s.v.push_back({i, m});
                    }
                }
            }
        } else {
            for (int i = 1; i <= n; i++) {
                s.v.push_back({i, lastCol + n});
            }
        }
        lastCol += n;
    }

    return s;
}

int main() {
#ifdef HOME
    ifstream cin("input.in");
    ofstream cout("output.out");
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int n, m;
    cin >> n >> m;

    auto s1 = Solve(n, m);
    auto s2 = Solve(m, n);

    if (s1.v.size() < s2.v.size()) {
        swap(s1, s2);
        for (auto& itr : s1.v) {
            swap(itr.first, itr.second);
        }
    }

    cout << s1.v.size() << "\n";
    for (auto itr : s1.v) {
        cout << itr.first << " " << itr.second << "\n";
    }

    return 0;
}