#include<bits/stdc++.h>
using namespace std;
const int N=3e5+5;
struct points{
	int x,y;
};
points tong[N+1];
int n,m,length;
void solve(int l1,int r1,int l2,int r2){
	int d1=r1-l1+1,d2=r2-l2+1;
	if (d1==d2){
		for (int i=l2;i<=r2;++i){
			tong[++length]=(points){l1,i};
			if (i!=l2&&i!=r2) tong[++length]=(points){r1,i};
		}
	}
	else if (d1==1&&d2==2) tong[++length]=(points){l1,l2},tong[++length]=(points){l1,r2};
	else if (d1==2&&d2==1) tong[++length]=(points){l1,l2},tong[++length]=(points){r1,l2};
	else if ((d1&1)&&(d1<<1)==d2){
		for (int i=l2;i<=l2+d1-2;++i) tong[++length]=(points){l1,i},tong[++length]=(points){r1,i};
		solve(l1,r1,l2+((d1-1)<<1),r2);
	}
	else if ((d2&1)&&(d2<<1)==d1){
		for (int i=l1;i<=l1+d2-2;++i) tong[++length]=(points){i,l2},tong[++length]=(points){i,r2};
		solve(l1+((d2-1)<<1),r1,l2,r2);
	}
	else if (d1<d2){
		for (int i=l1;i<=r1;++i) tong[++length]=(points){i,l2};
		solve(l1,r1,l2+d1,r2);
	}
	else{
		for (int i=l2;i<=r2;++i) tong[++length]=(points){l1,i};
		solve(l1+d2,r1,l2,r2);
 	}
	return;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	cin>>n>>m,solve(1,n,1,m);
    cout<<length<<'\n';
	for (int i=1;i<=length;++i)
        cout<<tong[i].x<<" "<<tong[i].y<<'\n';
	return 0;
}