#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define ld long double
#define pb push_back
#define sws cin.tie(0)->sync_with_stdio(false);
#define endl '\n'

using namespace std;

const int N = 1e5+10;
const ll MOD = 998244353;
// const ll MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;


vector<pair<int, int>> solve(ll n, ll m) {
    vector<pair<int, int>> ans;
    int i;
    for (i=1;i<=m;i+=n) { // colunas completas
        for (int j=1;j<=n;j++) {
            ans.push_back({i, j});
        }
    }

    if (m <= n) {
        int resto = 0;
        for (;i>m;i--) {
            resto ++;
        }

        for (int j=resto+1;j<=n-resto;j++) {
            ans.push_back({m, j});
        }
    } else {
        for (int i=1;i<=n;i++) ans.pop_back();
        int left = ans.back().ff;
        int right = m;
        for (int i=1;i<=n;i++) ans.push_back({m, i}); // ultima coluna

        if (n % 2 == 0) {
            int mid = (left + right) / 2;
            int resto = left + n - mid;
            int l = resto + 1, r = n - resto;
            for (int i=l;i<=r;i++) { ans.push_back({mid, i}); }
        } else {
            int l = left + (n + 2 - 1) / 2;
            int r = right - (n + 2 - 1) / 2;
            for (int i=l;i<=r;i++) { ans.push_back({i, n/2+1}); }
        }
    }



    return ans;
}

int32_t main()
{
    #ifndef LOCAL
    sws;
    #endif

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

    vector<pair<int, int>> ans1 = solve(m, n);
    vector<pair<int, int>> ans2 = solve(n, m);

    if (ans1.size() < ans2.size()) {
        ans1 = ans2;
        for (auto &[x, y]: ans1) {
            swap(x, y);
        }
    }

    cout << ans1.size() << endl;
    for (auto [x, y]: ans1) {
        cout << x << " " << y << endl;
    }


    return 0;
}