A9620. Wonder Room

The 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 $6n$ 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.

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.

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.