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

#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

double A,B,C;
const double MAX_A = 1e18;
const double EPS = 1e-1;

double f(double x)
{
	return x * x * x + A * x * x + B * x + C;
}

double solve(double l,double r)
{
	if(f(l) >= EPS) swap(l,r);
	FOR(i,0,200){
		double mid = (l + r) / 2.0;
		if(f(mid) >= EPS){
			r = mid;
		}
		else{
			l = mid;
		}
	}
	return (l + r) / 2.0;
}

int main()
{
	scanf("%lf%lf%lf",&A,&B,&C);
	vector<ll> ans(1,solve(-MAX_A,MAX_A));
	while(ans.size() < 3){
		double x = solve(-MAX_A,ans.front() - 1);
		if(abs(f(x)) < EPS){
			ans.push_back(ll(x * 2) - ll(x));
			sort(ans.begin(),ans.end());
			ans.erase(unique(ans.begin(),ans.end()),ans.end());
		}
		x = solve(ans.back() + 1,MAX_A);
		if(abs(f(x)) < EPS){
			ans.push_back(ll(x * 2) - ll(x));
			sort(ans.begin(),ans.end());
			ans.erase(unique(ans.begin(),ans.end()),ans.end());
		}
		FOR(i,1,ans.size()){
			x = solve(ans [i - 1] + 1,ans [i] - 1);
			if(abs(f(x)) < EPS){
				ans.push_back(ll(x * 2) - ll(x));
				sort(ans.begin(),ans.end());
				ans.erase(unique(ans.begin(),ans.end()),ans.end());
			}
		}
	}

	FOR(i,0,ans.size()){
		printf("%lld%s",ans [i],i + 1 == ans.size() ? "\n" : " ");
	}

	return 0;
}