#include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <numeric>
#include <set>
#include <unordered_set>
#include <map>
#include <vector>
#include <string>
#include <deque>
#include <queue>
#include <iomanip>

using namespace std;
using ll  = long long;

void solve();

int main(void) {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	solve();
	return 0;
}

void solve() {
	ll x, y;
	cin >> x >> y;
	const ll n = x * y, m = x * y;
	cout << n << " " << m << "\n";
	for(intmax_t i=0;i<intmax_t(x);i++) {
		cout << i + 1 << " " << (i + 1) % x + 1 << "\n";
	}
	ll counter = x;
	for(intmax_t i=0;i<intmax_t(x);i++) {
		ll c = i;
		for(intmax_t j=0;j<intmax_t(y-1);j++) {
			cout << c + 1 << " " << counter + 1 << "\n";
			c = counter, counter++;
		}
	}
}