#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
#include <stack>

using namespace std;

#define ll long long int

struct binarysearch
{
    const int maxLoop = 128;
    
    const function<double(double)> f;
    
    binarysearch(function<double(double)> func) : f(func)
    {
    }
    
    double search(double left, double right)
    {
        for (int loop = 0; loop < maxLoop; ++loop){
            auto middle = (left + right) / 2;
            auto l = f(left);
            auto m = f(middle);
            if (l * m <= 0)
            {
                right = middle;
            } else
            {
                left = middle;
            }
        }
        return (right + left) / 2.0;
    }
};



int main()
{
    ll a,b,c;
    cin >> a >> b >> c;
    // 3x^2 + 2ax + b = 0;
    // -(2a) +
    auto left = -(2 * a + sqrt(4 * a * a - 4 * 3 * b)) / 6;
    auto right = -(2 * a - sqrt(4 * a * a - 4 * 3 * b)) / 6;
    
    binarysearch s([=](double x){ return x * x * x + a * x * x + b * x + c; });
    
    auto l = s.search(-1e11, left);
    auto m = s.search(left, right);
    auto r = s.search(right, 1e11);
    cout << (int)round(l) << " " << (int)round(m) << " " << (int)round(r) << endl;
    return 0;
}