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

const double MOD = 900000011;
long long n, c;

double FindX() {
    double res = (c+fmod(sqrt(c*c-4), MOD))/2;
    res = fmod(res, MOD);
    return res;
}

double FastStep(double a, long long step) {
    double res = 1;
    while(step > 0) {
        if(step%2 == 1) {
            res*= a;
            res = fmod(res, MOD);
        }
        step/= 2; a*= a;
        a = fmod(a, MOD);
    }
    return res;
}

int main()
{
    freopen("equation.in", "r", stdin);
    freopen("equation.out", "w", stdout);
    cin>>n>>c;
   //cout<<setprecision(12);
   cout<<fixed;
    c%= 900000011;
    double x = FindX();
    cout<<x<<endl;

    double xn = FastStep(x, n);
    double xn2 = fmod(xn*x, MOD)*xn;
    xn2 = fmod(xn2, MOD);

    double S = (xn2-1)/((x-1)*xn);
    S = fmod(S, MOD);
    if(S < 0) S+= MOD;

    cout<<S<<endl;

    return 0;
}