from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

a, b, c = MI()
if a<0:a,b,c=-a,-b,-c
if b ** 2 - 4 * a * c < 0: print("imaginary")
elif b ** 2 - 4 * a * c == 0: print(-b / 2 / a)
else:
    d = b ** 2 - 4 * a * c
    print((-b - d ** 0.5) / 2 / a, (-b + d ** 0.5) / 2 / a)