#include <bits/stdc++.h>


using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


const ll inf = 1e18;
mt19937 rnd(234);


int n, m;
vector<pair<int, int>> rs;


void solve_n_smlr_m() {
    set<int> a, b;
    for (int i = 1; i <= n; i += 1) {
        int x = i;
        int y = 1;
        rs.push_back({ x, y });
        a.insert(x + y);
        b.insert(x - y);
    }
    for (int i = 1; i <= n; i += 1) {
        int x = i;
        int y = m;
        if (a.find(x + y) != a.end() || b.find(x - y) != b.end()) {
            continue;
        }
        rs.push_back({ x, y });
        a.insert(x + y);
        b.insert(x - y);
    }
    int f = n;
    if (f % 2 == 0) {
        f -= 1;
    }
    int s = (f + 1) / 2;
    for (int j = s + 2; j <= m; j += 1) {
        int x = s;
        int y = j;
        if (a.find(x + y) != a.end() || b.find(x - y) != b.end()) {
            continue;
        }
        rs.push_back({ x, y });
        a.insert(x + y);
        b.insert(x - y);
    }
    if (n >= 2) {
        f = n;
        if (f % 2 == 1) {
            f -= 1;
        }
        int x0 = (2 + f) / 2;
        int y0 = x0 - 1;
        for (int j = y0 + 2; j <= m; j += 1) {
            int x = x0;
            int y = j;
            if (a.find(x + y) != a.end() || b.find(x - y) != b.end()) {
                continue;
            }
            rs.push_back({ x, y });
            a.insert(x + y);
            b.insert(x - y);
        }
    }
}


void solve() {
    if (n > m) {
        swap(n, m);
        solve_n_smlr_m();
        swap(n, m);
        for (auto& [x, y] : rs) {
            swap(x, y);
        }
    } else {
        solve_n_smlr_m();
    }
}


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n >> m;
    solve();
    cout << (int)rs.size() << "\n";
    for (auto [x, y] : rs) {
        cout << x << " " << y << "\n";
    }
    return 0;
}