#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include<fstream>
using namespace std;
#define eps 0.000000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define f(n) for(int i=0;i<n;++i)
#define REP(i,n) for(long long i = 0;i < n;++i)
double a, b, c;
double calc_f(double x) {
	double ans = x;
	ans += a;
	ans *= x;
	ans += b;
	ans *= x;
	ans += c;
	return ans;
}
double calc_fd(double x) {
	double ans = 3 * x;
	ans += 2 * a;
	ans *= x;
	ans += b;
	return ans;
}
int main() {
#define int long long
	cin >> a >> b >> c;
	double n = 1000000000;
failed:;
	for (int i = 0;i < 1000000;++i) {
		n = n - (calc_f(n) / calc_fd(n));
	}
	//nは解の一つ
	if (n == 0) {
		n = -1000000000;
		goto failed;
	}
	vector<long long> ans;
	ans.push_back(n);
	double q = 1;
	double w = a+ans[0];
	double h = -1 * (c / ans[0]);
	double topper = -1 * w + sqrt(w*w - 4 * q*h);
	topper /= 2 * q;
	ans.push_back(topper);
	topper = -1 * w - sqrt(w*w - 4 * q*h);
	topper /= 2 * q;
	ans.push_back(topper);
	sort(ans.begin(), ans.end());
	cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
	return 0;
}