#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
i64 n, m;
i64 flag, re;
vector<pair<i64,i64>> res;
void solve(){
	flag = 0;
	res.clear();
	cin >> n;
	cin >> m;
	//if(m < n){
		//swap(n,m);
		//flag = 1;
	//}
	i64 maxx = 0;
	i64 x, y, tx, ty;
	for(i64 i = 1; i <= m; i++){
		x = (n + (i-1)) / i;
		y = x * i;
		maxx = max(maxx, y);
	}
	
	swap(n, m);
	for(i64 i = 1; i <= m; i++){
		x = (n + (i-1)) / i;
		y = x * i;
		maxx = max(maxx, y);
	}
	re = 0;
	swap(n, m);
	
	for(i64 i = 1; i <= m; i++){
		x = (n + (i-1)) / i;
		y = x * i;
		if(maxx == y){
			for(i64 j = 0; j < x; j++){
				tx = j * i + 1;
				for(int k = 1; k <= i; k++){
					ty = k;
					res.push_back(make_pair(tx,ty));
				}
			}
			re = 1;
			break;
		}
	}
	
	if(re == 0){
		swap(n, m);
		flag = 1;
		for(i64 i = 1; i <= m; i++){
			x = (n + (i-1)) / i;
			y = x * i;
			if(maxx == y){
				for(i64 j = 0; j < x; j++){
					tx = j * i + 1;
					for(int k = 1; k <= i; k++){
						ty = k;
						res.push_back(make_pair(tx,ty));
					}
				}
				re = 1;
				break;
			}
		}
	}
    cout << res.size() << endl;
    for(int i = 0; i < res.size(); i++){
    	//cout << res[i].first << ' ' << res[i].second << endl;
    	
    	if(flag){
    		cout << res[i].second << ' ' << res[i].first << endl;
    	}
    	else{
    		cout << res[i].first << ' ' << res[i].second << endl;
    	}
    	
    }
    
    return;
}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

	long long tt = 1;
	//cin >> tt;
	while(tt--){
		solve();
	}

    return 0;
}