#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define fi first
#define se second
#define pp push_back
#define all(x) (x).begin(), (x).end()
#define Ones(n) __builtin_popcount(n)
#define endl '\n'
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
#define PI acos(-1)
//#define int long long
#define debug(x) cout << (#x) << " = " << x << endl

void Gamal() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int dx[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy[] = {-1, +1, +0, +0, +1, -1, +1, -1};

const double EPS = 1e-9;
const ll OO = 0X3F3F3F3F3F3F3F3F;
const int N = 1e6, INF = INT_MAX, MOD = 1e9 + 7, LOG = 20;


void solve() {
    char c;
    int a,b;cin >> a >> c >> b;
    for (int n = 2; n <= N; ++n) {
        ll tot = 1ll * n * a;
        if(tot % b)continue;
        tot /= b;
        int l = 1,r = n;
        while (l <= r){
            int mid = (l + r)/2;
            int rem = n - mid;
            ll dis = 1ll * mid * (mid - 1)/2;
            ll mn = rem, mx = 1ll * rem * mid;
            if(dis > tot){
                r = mid - 1;
                continue;
            }
            ll lft = tot - dis;
            if(lft < mn){
                r = mid - 1;
            }
            else if(lft > mx){
                l = mid + 1;
            }
            else{
                cout << n << ' ' << n - 1 << endl;
                for (int i = 1; i <= mid - 1; ++i) {
                    cout << i << ' ' << i + 1 << endl;
                }
                tot -= dis;
                int score = mid,cur = mid;
                for (int i = mid + 1; i <= n; ++i) {
                    int cnt = n - i;
                    while (tot - score < cnt)score--,cur--;
                    assert(cur >= 1);
                    cout << i << " " << cur << endl;
                    tot -= score;
                }
                return;
            }
        }
    }
    cout << "impossible";
}


signed main() {
    Gamal();
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}