#include <bits/stdc++.h>

using namespace std;
using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VL = vector<LL>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using ld = long double;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define FILL(a, b) memset(a, b, sizeof(a))

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	LL a, b;
	char slash;
	cin >> a >> slash >> b;
	int n = b;
	while (n <= 1000000 && (b * (n - 1) < 2 * a || a * n < b * (n - 1))) {
		n += b;
	}
	if (n > 1000000) {
		cout << "impossible\n";
		return 0;
	}
	a *= n / b;
	cout << n << " " << n - 1 << "\n";
	LL k = 1;
	while (k * (k + 1) / 2 + (n - 1 - k) <= a) {
		k++;
	}
	k--;
	a -= k * (k + 1) / 2;
	FOR(i, 1, k + 1) {
		cout << i << " " << i + 1 << "\n";
	}
	FOR(i, k + 2, n) {
		cout << "1 " << i << "\n";
	}
	if (k != n - 1) {
		int d = a - (n - 2 - k);
		assert(d <= k + 1);
		cout << d << " " << n << "\n";
	}
}