# coding: utf-8
import collections, copy, heapq, itertools, math, sys
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    A, B, C = ILI()
    return A, B, C


def calc_equation(A, B, C, x):
    if pow(x, 3) + A * pow(x, 2) + B * x + C == 0:
        return True
    else:
        return False


def solve(A, B, C):
    ans = [None] * 3
    x = 0
    while ans[-1] is None:
        if x == 0:
            if calc_equation(A, B, C, 0):
                ans[0] = 0
        else:
            if calc_equation(A, B, C, x):
                for i in range(3):
                    if ans[i] is None:
                        ans[i] = x
                        break
            if calc_equation(A, B, C, -x):
                for i in range(3):
                    if ans[i] is None:
                        ans[i] = -x
                        break

        x += 1

    ans = " ".join(map(str, sorted(ans)))

    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()