#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define ar arry
typedef int uci;
#define int long long
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

void solve(){

    int N, M; cin >> N >> M;
    vector<pii> out;
    priority_queue<pair<int,int>> cols[2], rows[2];

    for(int i = 0; i < N+M-1; i++) {
        if(i == 0) { out.push_back({0,0}); continue; }
        auto& col = cols[i%2];
        auto& row = rows[i%2];
        if(i < N) col.push({-( 2*min(M, N-i) + i ), i});
        if(i  < M) {
            if(i == M-1 && M==N) {
                ;
            } else {
                row.push({-( 2*min(N, M - i) + i), i});
            }
        } 


        if(col.size() && !(row.size() && row.top().first > col.top().first)) {
            dcol:
            out.push_back({col.top().second+(i-col.top().second)/2, (i-col.top().second)/2}); col.pop();
        } else if(row.size()) {
            drow:
            out.push_back({(i-row.top().second)/2, row.top().second+(i-row.top().second)/2}); row.pop();
        }
    }

    cout << out.size() << endl;
    for(auto xy: out) cout << xy.first+1 << " " << xy.second+1 << endl;

}

uci main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    solve();
}