You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Problem Statement

You are currently at the origin $(0, 0)$ in a two-dimensional plane and you need to move a distance of $1$ unit towards the point $(A, B)$. Your task is to find your coordinates after the move.

Here, moving a distance $d$ from a point $X$ to a point $Y$ ($d \leq$ length of the segment $XY$), places you at the point on the segment $XY$ whose distance from $X$ is $d$. The constraints guarantee that the distance between the points $(0, 0)$ and $(A, B)$ is at least $1$.

INPUT FORMAT (input arrives from the terminal / stdin):

The first line of the input contains two integers $A$ and $B$, the coordinates of the point you are moving towards. It is guaranteed that $(A, B) \neq (0, 0)$.

OUTPUT FORMAT (print output to the terminal / stdout):

Print two numbers $x$ and $y$, your coordinates after the move. They should be printed in this order, separated by a space.

Your output is considered correct when, for each printed value, the absolute or relative error from the judge's answer is at most $10^{-6}$.

SAMPLE INPUT 1:

3 4

SAMPLE OUTPUT 1:

0.600000000000 0.800000000000

If you print 0.5999999999 0.8000000001, for example, would also be accepted.

SAMPLE INPUT 2:

246 402

SAMPLE OUTPUT 2:

0.521964870245 0.852966983083

If you print 0.5999999999 0.8000000001, for example, would also be accepted.

SCORING:

• For all inputs: $0 \leq A, B \leq 1000$