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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

double a, b, c;

int s(LL xx) {
	double x = xx;
	double v = x*x*x + a*x*x + b*x + c;
	return (v == 0 ? 0 : (v > 0 ? 1 : -1));
}

LL bs(double ll, double hh) {
	LL L = floor(ll);
	LL H = floor(hh);
	
	
	while(H - L > 1) {
		LL M = (L + H) / 2;
		if(s(M) == 0) { return M; }
		(s(M) == s(L) ? L : H) = M;
	}
	
	//assert(s(H) == 0);
	return H;
}

int main() {
	cin >> a >> b >> c;
	
	double x1 = (-a - sqrt(a * a - 3 * b)) / 3.0;
	double x2 = (-a + sqrt(a * a - 3 * b)) / 3.0;
	
	cout << bs(-1e9, x1) << " " << bs(x1, x2) << " " << bs(x2, +1e9) << endl;
	
	return 0;
}