#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
const int N = 1e6 + 10;
const int M = 131;
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;

void solve(){
    int n, m; cin >> n >> m;
    int nwx = 1, nwy = m, zx = 0, zy = 0;
    vector<pair<int, int>> pos;
    while(n - zx != m - zy){
        if(n - zx < m - zy){
            for(int i = nwx; i <= n; i++) pos.push_back({i, nwy});
            nwy = nwy - (n - zx);
            zy = zy + (n - zx);
        }
        else{
            for(int i = 1; i <= nwy; i++) pos.push_back({nwx, i});
            nwx = nwx + (m - zy);
            zx = zx + (m - zy);
        }
        //cout << n << ' ' << m << ' ' << res << '\n';
        //cout << n << ' ' << m << ' ' << pos.size() << ' ' << nwx << ' ' << nwy << ' ' << zx << ' ' << zy << '\n';
    }
    if(n == 1) pos.push_back({nwx, nwy});
    else if(n == 2){
        for(int i = 1; i <= nwy; i++) pos.push_back({nwx, i});
    }
    else{
        for(int i = 1; i <= nwy; i++) pos.push_back({nwx, i});
        nwx = nwx + (m - zy) - 1;
        for(int i = 2; i <= nwy - 1; i++) pos.push_back({nwx, i});
    }
    cout << pos.size() << '\n';
    for(auto [x, y] : pos) cout << x << ' ' << y << '\n';
    // int a[n + 1][m + 1];    
    // for(auto [x, y] : pos)
    //     a[x][y] = 1;
    // for(int i = 1; i <= n; i ++)
    //     for(int j = 1; j <= m; j ++)
    //         if(a[i][j] == 1)
    //             cout << 1 << " \n"[j == m];
    //         else
    //             cout << 0 << " \n"[j == m];
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(12);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0 - 0;
}