#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<iterator>
//#include<random>
#include<unordered_set>
#include<map>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const int mod=1000000007;
const int big=1e9+10;
const long double pai=3.141592653589793238462643383279;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
int gcd(int a,int b){if(a%b==0){return b;}else return gcd(b,a%b);}//a>b
int main(void){
	llint a,b,c;cin>>a>>b>>c;
	//にぶたんー＞二次ー＞えい
	llint ue=mod,st=-mod,ans;
	while(-1){
		llint gen=(ue+st)/2;
		long double now=gen+a;
		now*=gen;now+=b;
		now*=gen;now+=c;
		if(now>0){ue=gen;}
		if(now<0){st=gen;}
		if(now==0){ans=gen;break;}
	}
	llint p,q;//x^2+xp+q=0
	p=a+ans;
	if(ans!=0){q=-c/ans;}else{q=b;}
	vector<llint> kotae;kotae.pub(ans);
	kotae.pub((-p+sqrt(p*p-4*q))/2);
	kotae.pub((-p-sqrt(p*p-4*q))/2);
	sort(kotae.begin(),kotae.end());
	cout<<kotae[0]<<" "<<kotae[1]<<" "<<kotae[2]<<endl;
	return 0;
}