#include <bits/stdc++.h>

using namespace std;

__float128 mypow(__float128 t, int n)
{
    __float128 z = 1;
    for (int i = 1; i <= n; ++i) {
        z *= t;
    }
    return z;
}

__float128 floor(__float128 x)
{
    return floor((long double)x + 0.5);
}

__float128 fabs(__float128 x)
{
    return x > 0 ? x : -x;
}

__float128 tp[105];

signed main()
{
    int n;
    long long m;
    scanf("%d%lld", &n, &m);
    if (n < 100) {
        for (int q = 2; q <= 100; ++q) {
            for (int p = q - 1; p; --p) {
                tp[0] = 1;
                tp[1] = 1;
                for (int z = 2; z <= n; ++z) {
                    tp[z] = tp[z - 1] * (__float128)p / q;
                    tp[0] += tp[z];
                }
                __float128 now = m / tp[0];
                int flg = 1;
                for (int i = 1; i <= n; ++i) {
                    flg &= (fabs(now * tp[i] - floor(now * tp[i])) < 1e-6);
                }
                if (flg) {
                    printf("%d %d\n", q - p, q);
                    return 0;
                }
            }
        }
    }
    puts("impossible");
    return 0;
}