using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Extentions;

class IO
{
    int idx;
    string[] input = In.ReadToEnd().Split(new[] { " ", "\n", "\r" },
        StringSplitOptions.RemoveEmptyEntries);

    T Get<T>(Func<string, T> parser) => parser(input[idx++]);

    public string S => Get(s => s);
    public char C => Get(char.Parse);
    public int I => Get(int.Parse);
    public long L => Get(long.Parse);
    public double F => Get(double.Parse);
    public decimal D => Get(decimal.Parse);
    public BigInteger B => Get(BigInteger.Parse);

    T[] Gets<T>(int n, Func<string, T> parser)
        => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray();

    public string[] Ss(int n) => Gets(n, s => s);
    public char[] Cs(int n) => Gets(n, char.Parse);
    public int[] Is(int n) => Gets(n, int.Parse);
    public long[] Ls(int n) => Gets(n, long.Parse);
    public double[] Fs(int n) => Gets(n, double.Parse);
    public decimal[] Ds(int n) => Gets(n, decimal.Parse);
    public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse);

    public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs));
    public void Write(params object[] xs) => WriteLine(string.Join(" ", xs));
}

static class Extentions
{
    public static void Swap<T>(ref T x, ref T y)
    {
        var tmp = x;
        x = y;
        y = tmp;
    }
}

static class Program
{
    public static void Main()
    {
        var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        SetOut(sw);
        Solve(new IO());
        Out.Flush();
    }

    static long a, b, c;

    static BigInteger Calc(BigInteger x) => x * x * x + a * x * x + b * x + c;

    static int? Search(int low, int high)
    {
        var ok = high - 1;
        var ng = low;

        while (Abs(ok - ng) > 1)
        {
            var mid = (ok + ng) / 2;
            if (Calc(mid) >= 0) ok = mid;
            else ng = mid;
        }

        if (Calc(ok) == 0) return ok;

        ok = high - 1;
        ng = low;

        while (Abs(ok - ng) > 1)
        {
            var mid = (ok + ng) / 2;
            if (Calc(mid) <= 0) ok = mid;
            else ng = mid;
        }

        if (Calc(ok) == 0) return ok;
        return null;
    }

    static void Solve(IO io)
    {
        a = io.L;
        b = io.L;
        c = io.L;

        const int min = (int)-1e9;
        const int max = (int)1e9;

        var x1 = Search(min, max).Value;
        var x2 = Search(min, x1) ?? Search(x1, max).Value;
        if (x1 > x2) Swap(ref x1, ref x2);

        var x = new SortedSet<int?>() { null, x1, x2 };
        x.Add(Search(min, x1));
        x.Add(Search(x1, x2));
        x.Add(Search(x2, max));

        io.Write(x.Skip(1).ToArray());
    }
}