// S2OJ Submission #12345 @ 1703311737931

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

// int cnt[1024];
int main() {
  long long x, y;
  char c;
  cin >> x >> c >> y;
  long long g = __gcd(x, y);
  x /= g;
  y /= g;
  long long kmin = max(0LL, (2 * x - y) / (y * y));
  long long kmax = (2 * x + y) / (y * y);
  if (kmax <= kmin) {
    cout << "Impossible\n";
  } else {
    for (long long k = kmin + 1; k <= kmax; k++) {
      long long n = k * y;
      long long m = n * (n + 1) / 2 - k * x;
      cout << n << ' ' << m << '\n';
    }
  }
  return 0;
}