Codeforces Round #416 (Div. 2) has been moved to start on 27.05.2017 09:35 (UTC).
×

The following languages are only available languages for the problems from the contest

VK Cup 2015 - Wild Card Round 1:

- Picat 0.9

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Quadratic equation

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given a quadratic equation with integer coefficients *A* * *X*^{2} + *B* * *X* + *C* = 0. It is guaranteed that *A* ≠ 0 and that the equation has at least one real root. Output the roots of the equation.

Input

The only line of input contains integers *A*, *B* and *C* ( - 1000 ≤ *A*, *B*, *C* ≤ 1000, *A* ≠ 0), separated by spaces.

Output

Output the roots of the equation in increasing order. If the equation has a single root of multiplicity 2, output it once. The root is considered to be correct if its absolute or relative error does not exceed 10^{ - 4}.

Examples

Input

1 -2 1

Output

1

Input

1 0 -1

Output

-1 1

Input

2 -3 1

Output

0.5 1

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/26/2017 08:36:32 (c2).

Desktop version, switch to mobile version.
User lists

Name |
---|