#include<bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
int dep[N];
int main()
{
	int a,b;
	char c;
	cin>>a>>c>>b;
	int sum = a;
	int point = b-1;
	int j = 1;
	if(sum - point < 0 )
	{
		cout<<"impossible"<<endl;
		return 0;
	}
	while(1)
	{
		for(int i = 1 ; i <= point ; i ++ )
	{
		if( sum - (point * i) < 0 )
		{
			dep[i] = point ;
			int tem = point*i - sum ;
			sum = sum - (point * i);
			dep[i]-=tem;
			dep[i-1]+=tem;
			break;
		}
		else
		{
			sum-=i;
			point -= 1 ;
			dep[i] = 1 ;
			continue;
		}
	}
	if(sum>0)
	{
		j++;
		sum = 2*a;
		point = 2*b - 1 ;
		memset(dep,0,sizeof(dep));
	}
	else break;
	}
	int sum_ed = 0 ;
	int cnt_dep = 0;
	for(int i = 1; dep[i] ; i++ )
	{
		sum_ed+=dep[i];
		cnt_dep++;
	}	
	int cnt = 0;
//	for(int i = 1 ; dep[i] ; i++ )
//		cout<<dep[i]<<" ";
	cout<<j*b<<" "<<sum_ed<<endl;
	for(int i = 1; i <= cnt_dep ; i++)
	{
		if(dep[i] == 1)
		{
			cnt++;
			cout<<cnt<<" "<<cnt+1<<endl;
		}
		else
		{
			cnt++;
			for(int j = 1 ; j <= dep[i] ; j++)
			{
				cout<<cnt<<" "<<cnt+j<<endl;
			}
			break;
		}
	}
	cout<<cnt+1<<" "<<b*j;
}