0093. XYZ

Имя входного файла: xyz.in
Имя выходного файла: xyz.out
Ограничение по времени: 2 s
Ограничение по памяти: 64 megabytes

Your task is to find at least one set of integer numbers x, y and z such that ax2+by2+cz2=0. You must find such set that x, y and z are not all zeroes.

Input file

Input file contains three integer numbers a, b and c, not exceeding 3000 by their absolute values.

Output file

Output any possible set x, y and z. At least one number must be non-zero. If there are no such sets, output IMPOSSIBLE instead.

Examples:

xyz.inxyz.out
1 1 -13 4 5
1 1 1IMPOSSIBLE


Источник: Petrozavodsk Winter 2003. Final Contest, Saturday, February 08

Обсудить       Отправить решение



Версия для печати