#!/usr/bin/env python3
def binsearch_float(l, r, pred): # [l, r)
    assert l < r
    for _ in range(100):
        m = (l + r) / 2
        if pred(m):
            r = m
        else:
            l = m
    return r

a, b, c = map(int, input().split())
f = lambda x: x ** 3 + a * x ** 2 + b * x + c
df = lambda x: 3 * x ** 2 + 2 * a * x + b
x2 = - a / 3
x1l = binsearch_float(- 10 ** 12, x2, lambda x: df(x) < 0)
x1r = binsearch_float(x2, + 10 ** 12, lambda x: df(x) > 0)
x0a = binsearch_float(- 10 ** 12, x1l, lambda x: f(x) > 0)
x0b = binsearch_float(x1l,        x1r, lambda x: f(x) < 0)
x0c = binsearch_float(x1r, + 10 ** 12, lambda x: f(x) > 0)

xs = set()
for x0 in [ x0a, x0b, x0c ]:
    for delta in range(-10, 11):
        if f(int(x0) + delta) == 0:
            xs.add( int(x0) + delta )
print(*sorted(xs))