#include<bits/stdc++.h>
using namespace std;

int a,b;

void solve(int t){
    long long a,b;
    string ss,s1,s2;
    cin>>ss;
    
    bool mode = false;
    for(int i=0;i<ss.size();i++){
        if(ss[i]=='/'){
            mode=true;
            continue;
        }
        if(!mode){
            s1.push_back(ss[i]);
        }else{
            s2.push_back(ss[i]);
        }
    }
    
    a = stoll(s1), b = stoll(s2);
    
    for(int n=1;n<=3000;n++){
        long long s = n*(n-1)/2;
        for(int y=0;y<=1000;y++){
            if(b*n-b-a==0)continue;
            
            if((a*n+a*y-s*b-y*n*b)%(b*n-b-a)==0){
                long long x = (a*n+a*y-s*b-y*n*b)/(b*n-b-a);
                
                if(n==1 && x!=0)continue;
                if(x>=0){
                    
                    cout<<n+x+y<<" "<<n+x+y-1<<"\n";
                    int cont=2;
                    for(int i=0;i<n-1;i++){
                        cout<<cont-1<<" "<<cont<<"\n";
                        cont++;
                    }
                    
                    int last=cont-1;
                    int plast=cont-2;
                    for(int i=0;i<x;i++){
                        cout<<plast<<" "<<cont<<"\n";
                        cont++;
                    }
                    
                    for(int i=0;i<y;i++){
                        cout<<last<<" "<<cont<<"\n";
                        cont++;
                    }
                    
                    return;
                }
            }
        }
    }
    
    cout<<"impossible\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}