#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

ll ans[5];

int main()
{
	ll a, b, c;
	cin >> a >> b >> c;

	int j = 0;
	for (ll i = -1000000; i <= 1000000; i++) {
			if (((i*i*i) + a*(i*i) + b*i + c)== 0) {
				ans[j++] = i;
			}
		}

	sort(ans, ans + 3);
	cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
	return 0;
}