import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write a,b,c=map(int,readline().split()) D=b**2-4*a*c if D<0: ans=["imaginary"] elif D==0: ans=[(-b)/(2*a)] else: ans=[(-b+math.sqrt(D))/(2*a),(-b-math.sqrt(D))/(2*a)] ans.sort() print(*ans)