codeforces 322A. Ciel and Dancing

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ls rt<<1
#define rs ls1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-9)
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000007
#define inf 100000007
#define pi acos(-1.0)
#define M 200000+5
int main(){
    int n,m,i,j,t;
    while(~scanf("%d %d",&n,&m)){
i=1;j=1;t=n+m;
printf("%d\n",t-1);
while(t>1){
printf("%d %d\n",i,j);
if(i<n)i++;
else if(j<m)j++;
t--;
}
}
    return 0;
}