#include<bits/stdc++.h>
using namespace std; 
 
#define fwd(i, a, n) for (int i = (a); i < (n); ++ i)
#define rep(i, n) fwd(i, 0, n)
#define all(X) begin(X), end(X)
#define sz(X) ((int)X.size())
#define st first
#define nd second
#define pii pair<int, int>
#define vi vector<int>
 
#ifdef LOC
template<typename Stream, typename T1, typename T2>
Stream& operator << (Stream& out, pair<T1, T2> a) {return out << "(" << a.st << ", " << a.nd << ")";}
 
template<typename Stream, typename T>
Stream &operator << (Stream& out, T v) {
	out << "{";
	int i = 0;
	for (auto x : v)
		out << x << ((++ i) != sz(v) ? ", " : "");
	return out << "}";
}
 
template<typename... Args>
void dump(Args... x) {((cerr << x << ", "), ...) << '\n';}
 
#define debug(x...) cerr << "[" #x "]: ", dump(x)
#else
#define debug(...) 0
#endif
 
using ll = long long;
 
 
int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	int n, m; cin>>n>>m;
	bool swapped  =false;
	if(n > m){
		swapped = true;
		swap(n, m);
	}
	vector<pair<int, int>> ans;
	if(n == m){
		for(int i = 1; i <= n; i++)ans.push_back({i, 1});
		for(int i = 2; i <= n-1; i++)ans.push_back({i, m});
	}else if(n % 2 == 1){
		for(int i = 1; i <= n; i++)ans.push_back({i, 1});
		for(int i = 1; i <= n; i++)ans.push_back({i, m});
		for(int j = (n/2) + 2; j <= m - (n/2) -1; j++)ans.push_back({(n/2) + 1, j});
	}else{
		for(int i = 1; i <= n; i++)ans.push_back({i, 1});
		for(int i = 1; i <= n; i++)ans.push_back({i, m});
		for(int j = (n/2) + 2; j <= m - (n/2) - 1; j+= 2){
			ans.push_back({n/2, j});
			ans.push_back({n/2 + 1, j});
		}
	}
	if(swapped){
		cout<<sz(ans)<<"\n";
		for(auto p : ans)cout<<p.second<<" "<<p.first<<"\n";
	}else{
		cout<<sz(ans)<<"\n";
		for(auto p : ans)cout<<p.first<<" "<<p.second<<"\n";
	}
	return 0;
}