#include<bits/stdc++.h>
void solve(int A,int B) {
	std::vector< std::pair<int,int> > edge;
	int pos = B + 1;
	for(int i=2;i<=B;i++) {
		int re = B - i;
		if (A - (i - 1) >= re) {
			A -= i - 1;
			edge.push_back({i-1,i});	
		}
		else {
			pos = i;
			break;
		}
	}
	if (pos != B + 1) {
		for(int i = pos; i < B;i++) {
			A--;
			edge.push_back({1,i});
		}
		edge.push_back({A,B});
	}
	printf("%d %ld\n",B,edge.size());
	for(auto i : edge) {
		printf("%d %d\n",i.first,i.second);
	}
	exit(0);
}
int main() {
	int a,b;
	scanf("%d/%d",&a,&b);
	for(int i=1;i<=1000000;i++) {
		if (b * i > 1e6) {
			break;
		}
		int A = a * i;
		int B = b * i;
		if (A >= (B - 1) && A <= 1ll * B * (B - 1) / 2) {
			solve(A,B);
		}
	}
	printf("impossible\n");
}