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

#define pb push_back
typedef pair<int, int> pii;

const int maxn = 111;
const double pi = atan2(0, -1);

long long r, s, h, d, a3, a2, a1;
double y, l, f, est, L, mn = 1e9;

void check_n1(int n3, int n2, int n1, int debug=false) {
    f = fabs(n3 * (y-d));
    est = n3/n1 - n3/n2 + 1;
    L = fabs(f - est) / n3;
    if (L<mn) {
        mn = L;
        a3 = n3;
        a2 = n2;
        a1 = n1;
    }
    if (debug) {
        printf("y=%lf, d=%d, f=%lf, est=%lf, L=%lf, mn=%lf\n", y, d, f, est, L, mn);
    }
}
void check_n2(int n3, int n2) {
    for (int n1=2;n1*n1<=n2;n1++)
        if (n2%n1==0) {
            check_n1(n3, n2, n1);
            if (n1*n1!=n2)
                check_n1(n3, n2, n2/n1);
        }
}

int main() {
    scanf("%lld%lld%lld",&r,&s,&h);
    l = 2*pi*r;
    y = l / s / h;

    // y = 365;
    d = round(y);
    // printf("%lf\n", pi);

    for (int n3=4;n3<=1000;n3++) {
        for (int n2=2;n2*n2<=n3;n2++)
            if (n3%n2==0) {
                check_n2(n3, n2);
                if (n2*n2!=n3) check_n2(n3, n3/n2);
            }
    }
    // printf("%lf\n", mn);
    printf("%lld %lld %lld\n", a1, a2 ,a3);
    // check_n1(a3, a2, a1, true);

    return 0;
}