#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;



    while (Q--) {
        int x, y;
        cin >> x >> y;
        int n = x * y;
        int m = x;
        
        vector<pair<int, int>>p;
        for (int i = 1; i < x; i++) {
            p.push_back({ i,i + 1 });
        }
        p.push_back({ 1,x});
        int d = x ;
        for (int i = 1; i <= x; i++) {
            d++;
            for (int j = 0; j < y-1; j++) {
                int a = i;
                if (j) {
                    a = d; p.push_back({ a,a + 1 });d++;
                }
                else p.push_back({ a,d });
                
            }
        }
        sort(p.begin(), p.end());
        cout << n << " " << p.size() << endl;
        for (int i = 0; i < p.size(); i++) {
            cout << p[i].first << " " << p[i].second << endl;
        }


    }
        return 0;
    }