/*
 * author:  ADMathNoob
 * created: 08/17/24 01:20:38
 * problem: https://qoj.ac/problem/5103
 */

/*
Comments about problem:


*/

#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  long long m;
  cin >> n >> m;
  int maxQ = (int) pow(m, 1.0 / (n - 1));
  while (pow(maxQ + 1, n - 1) <= m) {
    maxQ += 1;
  }
  for (int q = 2; q <= maxQ; q++) {
    for (int p = 1; p < q; p++) {
      long long powQ = 1;
      for (int i = 0; i < n - 1; i++) {
        powQ *= q;
      }
      long long powP = 1;
      long long s = 0;
      for (int i = 0; i < n; i++) {
        s += powP * powQ;
        if (s > m) {
          break;
        }
        powP *= q - p;
        powQ /= q;
      }
      assert(0 < s && s <= 2 * m);
      if (m % s == 0) {
        cout << p << ' ' << q << '\n';
        return 0;
      }
    }
  }
  cout << "impossible\n";
  return 0;
}