import math

def IM(): return map(int, input().split())
def IL()->list[int]: return [int(i) for i in input().split()]

R, Gx, Gy = IM()

r = math.sqrt(Gx**2 + Gy**2)

b = (3*r-R)/2
a = math.sqrt(R**2 - b**2)

s = b+(a**2/(R-b))
#print(s)
if s < 10**9:
    s = 0

if Gy == 0:
    print(s, 0)
    exit()

def keyfunc(n:float)->bool:
    global Gx, Gy
    ans_x = n
    ans_y = ans_x/(Gx/Gy)
    if math.sqrt(ans_x**2+ans_y**2) > abs(s):
        return True
    return False

def binary_search(key = keyfunc, MX = 2**62+2**61)->int:
    ng = -10**(-8)
    ok = MX
    while abs(ok - ng) > 10**(-8):
        mid = (ok+ng)/2
        if key(mid):
            ok = mid
        else:
            ng = mid
    return ok

binary_ans = binary_search()
if (s >= 0 and Gx >= 0) or (s <= 0 and Gx <= 0):
    print(binary_ans, binary_ans/(Gx/Gy))
else:
    print(-binary_ans, -binary_ans/(Gx/Gy))