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

#define CIN_ONLY if(1)
struct cww{cww(){
    CIN_ONLY{
        ios::sync_with_stdio(false);cin.tie(0);
    }
}}star;
#define fin "\n"
#define FOR(i,bg,ed) for(int i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define DEBUG if(0)
#define REC(ret, ...) std::function<ret (__VA_ARGS__)>
template <typename T>inline bool chmin(T &l,T r)
{bool a=l>r;if(a)l=r;return a;}
template <typename T>inline bool chmax(T &l,T r)
{bool a=l<r;if(a)l=r;return a;}
template <typename T>
istream& operator>>(istream &is,vector<T> &v){
    for(auto &it:v)is>>it;
    return is;
}
const LL inf=1e9;
const LL INF=1e18;
LL getone(LL a,LL b,LL c){
    if(c==0)return 0;
    FOR(i,-1000000,1000001)if(i==0||c%i==0){
        LL sum=1ll*i*i*i+a*i*i+b*i+c;
        if(sum==0)return i;        
    }
    
}

LL square_root(LL XX){
    LL ok=0,ng=2*inf+1;
    while(ng-ok>1){
        LL mid=(ok+ng)/2;
        if(mid*mid<=XX)ok=mid;
        else ng=mid;
    }
    return ok;
}
int main(){
    LL a,b,c;
    //xxx+Axx+Bx+C==0
    cin>>a>>b>>c;    
    LL A(a),B(b),C(c);
    vector<LL> res;
    res.pb(getone(A,B,C));
    //(x-res[0])(xx+Ax+B)==0
    A+=res[0];
    B+=A*res[0];
    //x=(-A+-sqrt(AA-4B))/2
    {
        LL sq=square_root(A*A-4*B);
        res.pb((-A+sq)/2);
        res.pb((-A-sq)/2);
    }    
    sort(ALL(res));
    cout<<res[0]<<" "<<res[1]<<" "<<res[2]<<endl;
    assert(-INF<a&&a<INF);
    assert(-INF<b&&b<INF);
    assert(-INF<c&&c<INF);

    REP(i,3){
        assert(-inf<res[i]&&res[i]<inf);
    }
    REP(i,2){
        assert(res[i]!=res[i+1]);
    }
    return 0;
}