#include <bits/stdc++.h>

using namespace std;

#define ll long long
const int INF=1e9,MOD=998244353;
const ll LINF=1e18;
#define fi first
#define se second
#define pii pair<int,int>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define pb push_back

void PRINT(int x) {cerr << x;}
void PRINT(ll x) {cerr << x;}
void PRINT(double x) {cerr << x;}
void PRINT(char x) {cerr << '\'' << x << '\'';}
void PRINT(string x) {cerr << '\"' << x << '\"';}
void PRINT(bool x) {cerr << (x ? "true" : "false");}

template<typename T,typename V>
void PRINT(pair<T,V>& x){
    cerr<<"{";
    PRINT(x.fi);
    cerr<<",";
    PRINT(x.se);
    cerr<<"}";
}
template<typename T>
void PRINT(T &x){
    int id=0;
    cerr<<"{";
    for(auto _i:x){
        cerr<<(id++ ? "," : "");
        PRINT(_i);
    }
    cerr<<"}";
}
void _PRINT(){
    cerr<<"]\n";
}
template<typename Head,typename... Tail>
void _PRINT(Head h,Tail... t){
    PRINT(h);
    if(sizeof...(t)) cerr<<", ";
    _PRINT(t...);
}

#define Debug(x...) cerr<<"["<<#x<<"]=["; _PRINT(x)

void CoutCell(int i,int j,bool swaped){
    if(swaped) cout<<j<<" "<<i<<endl;
    else cout<<i<<" "<<j<<endl;
}

void Solve(){
    int N,M; cin>>N>>M;
    bool swaped=false;
    if(N>M){
        swaped=true;
        swap(N,M);
    }

    if(N==1){
        cout<<M<<endl;
        for(int i=1;i<=M;i++) CoutCell(1,i,swaped);
    }
    else if(N==M){
        cout<<2*N-2<<endl;
        for(int i=1;i<=N;i++) CoutCell(i,1,swaped);
        for(int i=2;i<=N-1;i++) CoutCell(i,M,swaped);
    }
    else if(N&1){
        cout<<N+M-1<<endl;
        for(int i=1;i<=N;i++) CoutCell(i,1,swaped);
        for(int i=1;i<=N;i++) CoutCell(i,M,swaped);
        for(int i=(N+1)/2+1;i<=M-(N+1)/2;i++) CoutCell((N+1)/2,i,swaped);
    }
    else if(M&1){
        cout<<N+M-1<<endl;
        for(int i=1;i<=N;i++) CoutCell(i,1,swaped);
        for(int i=1;i<=N;i++) CoutCell(i,M,swaped);
        for(int i=N/2+2;i<=M-N/2-1;i+=2){
            CoutCell(N/2,i,swaped);
            CoutCell(N/2+1,i,swaped);
        }
    }
    else{
        cout<<N+M-2<<endl;
        for(int i=1;i<=N;i++) CoutCell(i,1,swaped);
        for(int i=1;i<=N;i++) CoutCell(i,M,swaped);
        for(int i=N/2+2;i<=M-N/2-1;i+=2){
            CoutCell(N/2,i,swaped);
            CoutCell(N/2+1,i,swaped);
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t; t=1;
    //cin>>t;
    while(t--){
        Solve();
    }
    return 0;
}