#include <bits/stdc++.h>

using namespace std;

long long int A, B, C;
__int128 f(__int128 x)
{
    return x * x * x + A * x * x + B * x + C;
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
   
    cin >> A >> B >> C;
    long long int res[3];
    long long int p0 = floor((-A - sqrt(A * A - 3 * B)) / 3);
    long long int p1 = ceil((-A + sqrt(A * A - 3 * B)) / 3);
    long long int lo = -1e9;
    long long int hi = p0;
    res[0] = -1e9;
    while (lo <= hi)
    {
        long long int mid = (lo + hi) / 2;
        if (f(mid) <= 0)
        {
            res[0] = max(res[0],mid);
            lo = mid + 1;
        }
        else
        {
            hi = mid - 1;
        }
    }
    lo = p0 + 1;
    hi = p1 - 1;
    res[1] = -1e9;
    while (lo <= hi)
    {
        long long int mid = (lo + hi) / 2;
        if (f(mid) >= 0)
        {
            res[1] = max(res[1],mid);
            lo = mid + 1;
        }
        else
        {
            hi = mid - 1;
        }
    }
    lo = p1;
    hi = 1e9;
    res[2] = -1e9;
    while (lo <= hi)
    {
        long long int mid = (lo + hi) / 2;
        if (f(mid) <= 0)
        {
            res[2] = max(res[2],mid);
            lo = mid + 1;
        }
        else
        {
            hi = mid - 1;
        }
    }

    cout << res[0] << ' ' << res[1] << ' ' << res[2] << '\n';
    return 0;
}