#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<pair<ll,ll> > ans;
map<ll,bool> sum,dif;
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m;
    cin >> n >> m;
    bool rotated=n<m;
    if (n<m)
        swap(n,m);
    for (ll i=1;i<=m;i++)
    {
        sum[1+i]=true;
        dif[1-i]=true;
        ans.push_back({1,i});
    }
    for (ll i=1;i<=m;i++)
    {
        if (!sum[n+i] && !dif[n-i])
        {
            sum[n+i]=true;
            dif[n-i]=true;
            ans.push_back({n,i});
        }
    }
    if (m&1)
    {
        for (ll i=1;i<=n;i++)
        {
            if (!sum[i+(m/2+1)] && !dif[i-(m/2+1)])
            {
                sum[i+(m/2+1)]=true;
                dif[i-(m/2+1)]=true;
                ans.push_back({i,(m/2+1)});
            }
        }
    }
    else
    {
        for (ll i=1;i<=n;i++)
        {
            if (!sum[i+(m/2+1)] && !dif[i-(m/2+1)])
            {
                sum[i+(m/2+1)]=true;
                dif[i-(m/2+1)]=true;
                ans.push_back({i,(m/2+1)});
                sum[i+m/2]=true;
                dif[i-m/2]=true;
                ans.push_back({i,m/2});
            }
        }
    }
    cout << ans.size() << "\n";
    for (auto i : ans)
    {
        if (rotated)
            cout << i.second << " " << i.first << "\n";
        else
            cout << i.first << " " << i.second << "\n";
    }
    return 0;
}