5509: Wonder Room

内存限制:256 MB 时间限制:2 S
题面:传统 评测方式:文本比较 上传者:
提交:3 通过:1

题目描述


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.
Input
The first line contains three space-separated integers n, a and b (1≤n,a,b≤109) − the number of students and the sizes of the room.
Output
Print three integers s, a1 and b1 (aa1;bb1) − the final area of the room and its sizes. If there are multiple optimal solutions, print any of them.

伴随着新学年的开始,学生们在宿舍住宿出现了问题。其中每一间宿舍有一个a * b 平方米的房间。宿管想在那里正好容纳 n个学生。但学校的要求规定,每个学生的房间必须至少有 6平方米(也就是说,n 名学生的房间必须至少有6n 平方米的面积)。宿管可以将房间的任何一侧(可能是两侧)扩大任意正整数米。请你帮助他扩建房间,使 m个学生都能住在里面,且使房间的总面积尽可能小。



Examples
Input
3 3 5
Output
18
3 6
Input
2 4 4
Output
16
4 4

输入样例 复制


输出样例 复制