Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

The problem statement has recently been changed. View the changes.

×
B. Wonder Room

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe start of the new academic year brought about the problem of accommodation students into dormitories. One of such dormitories has a *a* × *b* square meter wonder room. The caretaker wants to accommodate exactly *n* students there. But the law says that there must be at least 6 square meters per student in a room (that is, the room for *n* students must have the area of at least 6*n* square meters). The caretaker can enlarge any (possibly both) side of the room by an arbitrary positive integer of meters. Help him change the room so as all *n* students could live in it and the total area of the room was as small as possible.

Input

The first line contains three space-separated integers *n*, *a* and *b* (1 ≤ *n*, *a*, *b* ≤ 10^{9}) — the number of students and the sizes of the room.

Output

Print three integers *s*, *a*_{1} and *b*_{1} (*a* ≤ *a*_{1}; *b* ≤ *b*_{1}) — the final area of the room and its sizes. If there are multiple optimal solutions, print any of them.

Examples

Input

3 3 5

Output

18

3 6

Input

2 4 4

Output

16

4 4

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/22/2020 15:39:28 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|