#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
using ll =long long;
template<class T> bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}

void solve(){
    vector<pair<int,int>> ans;
    int N,M;
    cin>>N>>M;
    if(N==M){
        rep(i,0,N) ans.push_back({i+1,M});
        rep(i,1,N-1) ans.push_back({i+1,1});
    }
    else {
        bool tmp=0;
        if(N>M) tmp=1,swap(N,M);
        rep(i,0,N) ans.push_back({i+1,1});
        rep(i,0,N) ans.push_back({i+1,M});
        int l=N/2+2;
        int r=M-N/2;
        if(N&1) rep(i,l,r) ans.push_back({(N+1)/2,i});
        else{
            rep(j,0,r-l){
                if(j%2==0){
                    ans.push_back({N/2,j+l});
                    ans.push_back({N/2+1,j+l});
                }
            }
        }
        if(tmp) for(auto &x:ans) swap(x.second,x.first);
    }
    cout<<ans.size()<<"\n";
    for(auto x:ans){
        cout<<x.first<<" "<<x.second<<"\n";
    }
}


int main() {
    solve();
}