#include<bits/stdc++.h>
using namespace std;
int n,m;
struct node
{
    int x,y;
    friend bool operator < (node a,node b)
    {
        if(a.x!=b.x) return a.x<b.x;
        return a.y<b.y;
    }
}an[1000010];
map<node,bool> mp;
inline void prin(int ans)
{
    printf("%d\n",ans);
    for(int i=1;i<=ans;i++)
        printf("%d %d\n",an[i].x,an[i].y);
}
inline void W1(int i,int j)
{
    int x=m+i-j;
    if(x<=n&&x>=1) {mp[(node){x,m}]=1;return ;}
    x=n-i+j;
    if(x<=m&&x>=1) mp[(node){n,x}]=1;
}
inline void W2(int i,int j)
{
    int x=i+j-1;
    if(x<=n&&x>=1) {mp[(node){x,1}]=1;return ;}
    x=i+j-n;
    if(x<=m&&x>=1) mp[(node){n,x}]=1;
}
inline void W3(int i,int j)
{
    int x=i+j-m;
    if(x<=n&&x>=1) {mp[(node){x,m}]=1;return ;}
    x=i+j-1;
    if(x<=m&&x>=1) mp[(node){1,x}]=1;
}
inline void W4(int i,int j)
{
    int x=i-j+1;
    if(x<=n&&x>=1) {mp[(node){x,1}]=1;return ;}
    x=1-i+j;
    if(x<=m&&x>=1) mp[(node){1,x}]=1;
}
inline bool work(int x,int y,int &ans)
{
    if(x<1||x>n) return 0;
    if(y<1||y>m) return 0;
    an[ans+1]=(node){x,y};
    if(mp.find(an[ans+1])==mp.end())
    {
        ans++,mp[an[ans]]=1;
        return 1;
    }
    return 0;
}
int main()
{
    int ans=0;
    scanf("%d%d",&n,&m);
    if(n==1)
        for(int i=1;i<=m;i++) an[++ans]=(node){1,i};
    else if(m==1)
        for(int i=1;i<=n;i++) an[++ans]=(node){i,1};
    else
    {
        an[1]=(node){1,1},mp[an[1]]=1,ans++;
        W1(an[1].x,an[1].y);
        if(work(1,m,ans))
            W2(an[2].x,an[2].y);
        if(work(n,1,ans))
            W3(an[3].x,an[3].y);
        if(work(n,m,ans))
            W4(an[4].x,an[4].y);
        for(int i=2;i<=n||i<=m;i++)
        {
            if(work(1,i,ans)) W1(1,i),W2(1,i);
            if(work(1,m-i+1,ans)) W1(1,m-i+1),W2(1,m-i+1);
            if(work(i,1,ans)) W1(i,1),W3(i,1);
            if(work(n-i+1,1,ans))  W1(n-i+1,1),W3(n-i+1,1);
            if(work(n,i,ans)) W3(n,i),W4(n,i);
            if(work(n,m-i+1,ans)) W3(n,m-i+1),W4(n,m-i+1);
            if(work(i,m,ans)) W2(i,m),W4(i,m);
            if(work(n-i+1,m,ans))  W2(n-i+1,m),W4(n-i+1,m);
        }
    }
    prin(ans);
}