Donghyeok Pizza

When the Daejeon ACM-ICPC Regional ends, all of the contestants go together to Donghyeok Pizza, a restaurant near KAIST. Because the contest runs for five hours, everyone is extremely hungry. To eat as quickly as possible, they want to order one large pizza. But if the pizza is too big, it might not fit on the table. The table is a circle and the pizza is a rectangle. Given the radius of the table and the size of the pizza, write a program that determines whether the pizza can be placed on the table.

The input consists of several test cases. Each test case is given as three integers $r$, $w$, and $l$. Here $r$ is the radius of the table, and $w$ and $l$ are the width and length of the pizza, respectively. ($1 \le r \le 1000$, $1 \le w \le l \le 1000$) When a line containing $r = 0$ is given, the program terminates.

For each test case, print on its own line whether the pizza can be placed on the table. For the $i$-th test case (numbered starting from $1$), print Pizza i fits on the table. if the pizza fits, or Pizza i does not fit on the table. if it does not, where i is replaced by the actual test case number. A pizza whose corner touches the boundary of the table is considered to fit.