import sequtils,strutils,math,algorithm
var
    A,B,C : float64
    l,r : float64
    ans : array[3,int64]
    s,t,u : int64
(s,t,u) = stdin.readline.split.map(parseBiggestInt)
(A,B,C) = (s.float64,t.float64,u.float64)
proc f(x: float64):float64=
    return x * x * x + A * x * x + B * x + C

proc slope(x : float64):float64=
    return 3 * x * x + 2 * A * x + B

proc s2(x : float64):float64=
    return 6 * x + 2 * A

l = -pow(10.0,9.0).float64
r = pow(10.0,9.0).float64
while slope(l) > 0.0 or slope(r) > 0.0:
    if s2((l + r) / 2) < 0.0:
        l = (l + r) / 2
    else:
        r = (l + r) / 2
var
    l2 = -pow(10.0,9.0).float64
    r2 = l
while r2 - l2 > 1:
    if slope((l2 + r2) / 2.0) > 0.0:
        l2 = (l2 + r2) / 2.0
    else:
        r2 = (l2 + r2) / 2.0
var
    r3 = pow(10.0,9.0).float64
    l3 = r

while abs(r3 - l3) > 1:
    if slope((l3 + r3) / 2.0) > 0.0:
        r3 = (l3 + r3) / 2.0
    else:
        l3 = (l3 + r3) / 2.0
var
    l4 = -pow(10.0,9.0).float64
    r4 = r2
    m : float64
while f(r4) > 1 and r4 - l4 > 1:
    m = (l4 + r4) / 2.0
    if f(m) >= 0.0:
        r4 = m
    else:
        l4 = m
ans[0] = round(r4).int
var
    l5 = l2
    r5 = r3
while f(r5) < -1 and abs(r5 - l5) > 1:
    m = (l5 + r5) / 2.0
    if f(m) > 0.0:
        l5 = m
    else:
        r5 = m
ans[1] = round(r5).int
    
var
    l6 = r3
    r6 = pow(10.0,9.0).float64
while abs(f(r6)) > 1 and abs(r6 - l6) > 1:
    m = (l6 + r6) / 2.0
    if f(m) > 0.0:
        r6 = m
    else:
        l6 = m
ans[2] = floor(r6).int


for a in -10..10:
    for b in -10..10:
        for c in -10..10:
            var
                x,y,z : int64
            (x,y,z) = ((ans[0] + a).int64,(ans[1] + b).int64,(ans[2] + c).int64)
            if (x * y * z == -u and
                x + y + z == -s and
                x * y + y * z + z * x == t):
                ans[0] = x
                ans[1] = y
                ans[2] = z
ans.sort(system.cmp)
echo ans.join(" ")