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

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
#include <experimental/iterator>
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int main() {
  // cin.tie(nullptr)->sync_with_stdio(false);
  int a, b;
  scanf("%d/%d", &a, &b);

  for (int n = 2; n <= 1000000; n++) {
    if (n % b != 0) continue;

    int64_t x = 1LL * a * (n / b);
    int64_t mx = 1LL * n * (n - 1) / 2;
    if (x < n - 1) continue;
    if (x > mx) continue;

    vector<pair<int,int>> edge;
    const auto add_edge = [&](int x, int y) {
      edge.emplace_back(x, y);
    };
    add_edge(0, 1);
    int cur = n - 1;
    int last = 1;
    for (int i = 2; i < n; i++) {
      if (x - cur >= n - i) {
        cur += n - i;
        add_edge(last, i);
        last = i;
      } else {
        add_edge(last, i);
      }
    }

    cout << n << ' ' << edge.size() << '\n';
    for (auto [x, y] : edge)
      cout << x + 1 << ' ' << y + 1 << '\n';

    return 0;
  }

  cout << "impossible\n";

  return 0;
}