import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static long pow2(long a, long b) {
        long re = 1;
        while (b > 0) {
            if ((b & 1) == 1) {
                re *= a;        
            }
            b >>= 1;
            a *= a; 
        }
        return re;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNext()) {
            try {
                long N = scanner.nextLong();
                long M = scanner.nextLong();

                if (N > 200) N = 200;

                int p, q;
                double[] pw = new double[2];
                for (q = 2; ; q++) {
                    pw = pushBack(pw, pow2(q, N));
                    for (p = 1; p < q; p++) {
                        double d = pw[q] - pw[q - p];
                        if (d > 1.1 * M * q) {
                            if (p == 1) {
                                throw new ImpossibleException("impossible");
                            }
                            continue;
                        }
                        BigInteger qp = BigInteger.ONE;
                        BigInteger pp = BigInteger.ONE;
                        for (int i = 0; i < N; i++) {
                            qp = qp.multiply(BigInteger.valueOf(q));
                        }
                        for (int i = 0; i < N; i++) {
                            pp = pp.multiply(BigInteger.valueOf(q - p));
                        }
                        if (BigInteger.valueOf(M).multiply(BigInteger.valueOf(p)).mod(qp.subtract(pp)).equals(BigInteger.ZERO)) {
                            throw new FoundSolutionException(p, q);
                        }
                    }
                }
            } catch (ImpossibleException e) {
                System.out.println(e.getMessage());
            } catch (FoundSolutionException e) {
                done(e.getP(), e.getQ());
            }
        }
    }

    private static double[] pushBack(double[] array, double value) {
        double[] newArray = new double[array.length + 1];
        System.arraycopy(array, 0, newArray, 0, array.length);
        newArray[array.length] = value;
        return newArray;
    }

    private static void done(int p, int q) {
        System.out.println(p + " " + q);
    }
}

class ImpossibleException extends Exception {
    public ImpossibleException(String message) {
        super(message);
    }
}

class FoundSolutionException extends Exception {
    private final int p;
    private final int q;

    public FoundSolutionException(int p, int q) {
        this.p = p;
        this.q = q;
    }

    public int getP() {
        return p;
    }

    public int getQ() {
        return q;
    }
}