#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
 
int n;
int m;
vector<pair<int, int>> res[2];

void solve()
{
    cin >> n >> m;

    for (int t = 0; t < 2; t++) {
        if (t == 1) swap(n, m);
        map<int, bool> mp1, mp2;
        for (int i = 1; i <= n; i++) {
            if (mp1[i + 1] == true || mp2[i - 1] == true) continue;
            res[t].pb({i, 1});
            mp1[i + 1] = mp2[i - 1] = true;
        }   

        for (int i = 1; i <= n; i++) {
            if (mp1[i + m] == true || mp2[i - m] == true) continue;
            res[t].pb({i, m});
            mp1[i + m] = mp2[i - m] = true;
        }

        for (int j = 2; j <= m - 1; j++) {
            for (int i = max(1, n / 2 - 2); i <= min(n, n / 2 + 2); i++) {
                if (mp1[i + j] == true || mp2[i - j] == true) continue;
                res[t].pb({i, j});
                mp1[i + j] = mp2[i - j] = true;
            }
        }
    }

    if(sz(res[0]) < sz(res[1])) swap(res[0], res[1]);
    cout << sz(res[0]) << endl;
    for (auto [x, y] : res[0]) {
        cout << x << " " << y << endl;
    }
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // freopen(TASK".inp" , "r" , stdin);
    // freopen(TASK".out" , "w" , stdout);
 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}