#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cmath>
#include<set>
#include<cstring>

using namespace std;
typedef long long ll;

int main(){
    ll dist, speed, hours;
    cin >> dist >> speed >> hours;
    double days = (2*acos(-1)*dist)/(speed*hours);

    double decimal = days - (long)days;
    if(decimal > 0.5){
        decimal = 1 - decimal;
    }

    double min_diff = 100000000;

    double best_n1, best_n2, best_n3;

    for(unsigned n1 = 1; n1 <= 1000; n1++){
        for(unsigned n2 = 2*n1; n2 <= 1000; n2 += n1){
            for(unsigned n3 = 2*n2; n3 <= 1000; n3 += n2){
                double diff;
                if(decimal < 0.5){
                    diff = (1/(double) n1) - (1/(double) n2) + (1/(double) n3);
                } 
                
                // else {
                //     diff = -(1/(double) n1) + (1/(double) n2) - (1/(double) n3);
                // }   
                // only add to a day when the difference is less than 0.5 otherwise you subtract from the day

                if(n1 == 4 && n2 == 100 && n3 == 400){
                    // cout << "Value at right answer: " << diff << endl;
                }

                if(abs(decimal - diff) < min_diff){
                    // cout << "Found a better min diff: " << diff << " at " << n1 << " " << n2 << " " << n3 << endl;
                    min_diff = abs(decimal - diff);
                    best_n1 = n1; best_n2 = n2; best_n3 = n3;
                }
            }
        }
    }

    cout << best_n1 << " " << best_n2 << " " << best_n3 << endl;
    // cout << "DECIMAL: " << decimal << endl;
    return 0;
}