#! /usr/bin/env python3
import itertools
import random

def rf(x, a, n):
    return (x * x + a) % n

def rho(n):
    a = random.randint(0, n) + 1
    x = y = 2
    d = 1
    while d == 1:
        x = rf(x, a, n)
        y = rf(rf(y, a, n), a, n)
        d = gcd(abs(x - y), n)
    return d

def gcd(a, b):
    if a < b: a, b = b, a
    while b > 0 : b, a = a % b, b
    return a

def primefactor(n):
    r = []
    if n > 100000:
        for i in range(4):
            d = rho(n)
            if d != n:
                n //= d
                r += primefactor(d)
                break
    
    a, b = 0, 2
    while b * b <= n:
        if n % b == 0:
            n //= b
            r += [b]
        else:
            b += 1 + a
            a = 1
    if n > 1 : r += [n]
    
    return r
    
def f(A, B, C, a, b, c):
    for i, j, k in itertools.product([0, 1], repeat = 3):
        ai = a * [-1, 1][i]
        bj = b * [-1, 1][j]
        ck = c * [-1, 1][k]
        if sum([ai, bj, ck]) == -A and ai * bj * ck == -C and ai * bj + ai * ck + bj * ck == B:
            return 1, ai, bj, ck
    return 0, 0, 0, 0

def f2(A, B, C, a, b):
    for i, j in itertools.product([0, 1], repeat = 2):
        ai = a * [-1, 1][i]
        bj = b * [-1, 1][j]
        if sum([ai, bj]) == -A and ai * bj == B:
            return 1, ai, bj
    return 0, 0, 0

def main():
    A, B, C = map(int, input().split())
    p = primefactor(abs(C))
    t = [-1, 0, 1]
    if C != 0:
        for i in itertools.product([0, 1, 2], repeat = len(p)):
            a = b = c = 1
            for j, k in enumerate(i):
                if k == 0 : a *= p[j]
                if k == 1 : b *= p[j]
                if k == 2 : c *= p[j]
            d, a, b, c = f(A, B, C, a, b, c)
            if d:
                t = [a, b, c]
                break
        print(*sorted(t))
    else:
        p = primefactor(abs(B))
        for i in itertools.product([0, 1], repeat = len(p)):
            a = b = 1
            for j, k in enumerate(i):
                if k == 0 : a *= p[j]
                if k == 1 : b *= p[j]
            d, a, b = f2(A, B, C, a, b)
            if d:
                t = [a, b, 0]
                break
        print(*sorted(t))

if __name__ == '__main__':
    main()