#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define N 1000010
#define LL long long
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define drep(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int rd() {
	int res=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f*=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') res=(res<<1)+(res<<3)+(ch^48),ch=getchar();
	return res*f;
}
int A,B,n,m,sum;
int U[N],V[N];
int main() {
	scanf("%d",&A);
	char ch=getchar();
	scanf("%d",&B);
	int g=__gcd(A,B);A/=g,B/=g;
	if(A+1<B) {
		printf("impossible");
		return 0;
	}
	int k=(int)ceil(2.0*A/(B*B)+1.0/B);
	n=B*k,sum=A*n/B;
	int now=2;
	while(now<=n) {
		if(now-1+n-now>sum) break;
		sum-=now-1,U[++m]=now,V[m]=now-1;
//		cerr<<"FUCK "<<now<<" "<<sum<<endl;
		now++;
	}
	while(now<=n-1) U[++m]=now,V[m]=1,now++,sum--;
	if(now<=n) U[++m]=now,V[m]=sum;
	printf("%d %d\n",n,m);
	rep(i,1,m) printf("%d %d\n",U[i],V[i]);
	return 0;
}