#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

typedef long long ll;

const int N = 1e6;

ll A, B, C;

ll calc(ll x){
    return x*x*x+A*x*x+B*x+C;
}

double calc_d(ll y){
    double x = (double)y;
    return x*x*x+A*x*x+B*x+C;
}

int main(){
    cin >> A >> B >> C;
    int ans[3];
    for(int i = -N; i <= N; i++){
        if(abs(calc_d(i)) > 100000) continue;
        if(calc(i) == 0){
            ans[0] = i;
            break;
        }
    }
    ll b, c;
    if(ans[0] == 0){
        b = A;
        c = B;
    }else{
        b = A+ans[0];
        c = -C/ans[0];
    }
    ll sq = sqrt(b*b-4*c);
    if((sq+1)*(sq+1) == b*b-4*c) sq = sq+1;
    ans[1] = (-b-sq)/2;
    ans[2] = (-b+sq)/2;
    sort(ans, ans+3);
    cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << endl;
}