#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n,m,i,j,k,l,r,x,y,z,w,s,t,sp,a[1100][1100];
vector<pair<ll,ll>> ans;
void answer()
{
    printf("%d\n",ans.size());
    for(auto pp:ans)
    {
        x=pp.first;
        y=pp.second;
        //a[x][y]=1;
        if(sp)
            swap(x,y);
        printf("%lld %lld\n",x,y);
    }
    return;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
            printf("%lld",a[i][j]);
        printf("\n");
    }
}
int main()
{
    scanf("%lld %lld",&n,&m);
    if(n>m)
    {swap(n,m);
    sp=1;
    }
    if(n==1||(n==2&&m%2==0))
    {
        for(i=1;i<=m;i++)
        ans.push_back({1,i});
        answer();
        return 0;
    }
    if(n==2)
    {
        for(i=1;i<=n;i+=2)
        {
            ans.push_back({1,i});
            ans.push_back({2,i});
        }
        answer();
        return 0;
    }
    if(n==m)
    {
        printf("%lld\n",n*2-2);
        for(i=1;i<=n-1;i++)
        {
            printf("%lld 1\n%lld %lld\n",i,i,n);
        }
        return 0;
    }
    for(i=1;i<=n;i++)
    {
        ans.push_back({i,1});
        ans.push_back({i,m});
    }
    if(n%2==1||(n%2==0&&m%2==0))
    {
        for(i=(n+2)/2+1;i<=m-(n+2)/2;i++)
        {
            ans.push_back({(n+1)/2,i});
        }
    }
    else
    {
        for(i=n/2+1;i<=m-n/2;i+=2)
        {
            ans.push_back({n/2,i});
            ans.push_back({n/2+1,i});
        }
    }
    answer();
}