using System;
using System.Numerics;
using System.Linq;

class Solution
{
    // ビエタの解
    static double[] Solve(BigInteger a, BigInteger b, BigInteger c)
    {
        var p = (double)(3 * b - a * a) / 9;
        var t = 2 * a * a * a - 9 * a * b + 27 * c;
        var q = (double)t / 54;
        try
        {
            q = (double)((decimal)t / 54);
        }
        catch (OverflowException)
        {
        }

        var lamda = 2 * Math.Sqrt(-p);
        var theta = Math.Acos(-q / Math.Sqrt(-p * p * p)) / 3;
        var gamma = (double)a / 3;
        var x = new double[3];
        x[0] = lamda * Math.Cos(theta + 2 * Math.PI / 3) - gamma;
        x[1] = lamda * Math.Cos(theta - 2 * Math.PI / 3) - gamma;
        x[2] = lamda * Math.Cos(theta) - gamma;
        return x;
    }

    static void Main()
    {
        var vals = Console.ReadLine().Split(' ').Select(BigInteger.Parse).ToArray();
        var a = vals[0];
        var b = vals[1];
        var c = vals[2];

        var xs = Solve(a, b, c).Distinct().Select(d => new BigInteger(Math.Round(d))).ToList();

        // 計算誤差対策のため，チェック
        foreach (var x in xs.ToList())
        {
            if (x * x * x + a * x * x + b * x + c != 0)
            {
                xs.Remove(x);
            }
        }

        // 1ミスのみ救済 (手抜き)
        if (xs.Count == 2)
        {
            // C == −αβγ より
            var x = -c / xs[0] / xs[1];
            xs.Add(x);
            xs.Sort();
        }

        Console.WriteLine(string.Join(" ", xs));
    }
}