#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<complex>

#define INF 1000000000
#define MOD 1000000007
#define EPS 1e-8

#define REP(i, m) for(long long i = 0; i < m; ++i)
#define FOR(i, n, m) for(long long i = n; i < m; ++i)
#define ALL(v) v.begin(), v.end()
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;

ll hoge(ld e) {
	if(e < 0) return (ll)e - 1;
	else return (ll)e;
}

int main() {
	ld a, b, c;
	cin>>a>>b>>c;
	ld lb = -1000000000;
	ld ub = -(a/3) + EPS;
	ll cnt = 0;
	while(cnt < 1000) {
		ld mid = (lb + ub) / 2;
		if(3 * mid * mid + 2 * a * mid + b >= 0) lb = mid;
		else ub = mid;
		++cnt;
	}
	ld lm = lb;
	lb = -(a/3);
	ub = 1000000000;
	cnt = 0;
	while(cnt < 1000) {
		ld mid = (lb + ub) / 2;
		if(3 * mid * mid + 2 * a * mid + b <= 0) lb = mid;
		else ub = mid;
		++cnt;
	}
	ld rm = lb;
	ll al, be, ga;
	ub = lm;
	lb = -1000000000;
	cnt = 0;
	while(cnt < 100000) {
		ld mid = (lb + ub) / 2;
		if(mid * mid * mid + a * mid * mid + b * mid + c <= 0) lb = mid;
		else ub = mid;
		++cnt;
	}
	al = hoge(lb + 1e-4);
	ub = rm;
	lb = lm;
	cnt = 0;
	while(cnt < 100000) {
		ld mid = (lb + ub) / 2;
		if(mid * mid * mid + a * mid * mid + b * mid + c >= 0) lb = mid;
		else ub = mid;
		++cnt;
	}
	be = hoge(lb + 1e-4);
	lb = rm;
	ub = 1000000000;
	cnt = 0;
	while(cnt < 100000) {
		ld mid = (lb + ub) / 2;
		if(mid * mid * mid + a * mid * mid + b * mid + c <= 0) lb = mid;
		else ub = mid;
		++cnt;
	}
	ga = hoge(lb + 1e-4);
	cout<<al<<" "<<be<<" "<<ga<<endl;
}