A Packing Problem

Miguel packs cans into boxes with a rectangular base. Every can is a right circular cylinder, and the two cans can have different heights. The height of the box is always greater than the height of either can.

Miguel wants to put two cans, whose radii may differ, into one box. The packing is good if both cans stand upright (looking into the box from above you see the two circular bases) and neither can sits on top of the other. Every other arrangement is bad. The two cans may touch each other on the sides, and a can may touch a wall of the box.

In other words, the packing is good exactly when both base circles lie inside the rectangular base of the box and the interiors of the two circles do not overlap. Two circles that meet at a single point do not count as overlapping.

Given the two side lengths of the base of the box and the radii of the two cans, decide whether a good packing exists.

The first line contains the number of test cases $T$.

Each of the next $T$ lines contains four integers $L$, $W$, $R_1$, $R_2$ separated by single spaces. $L$ and $W$ are the side lengths of the base of the box, and $R_1$ and $R_2$ are the radii of the two cans to be packed.

Constraints

• $1 \le T \le 10^5$
• $1 \le L \le 10^4$
• $1 \le W \le 10^4$
• $1 \le R_1 \le 10^4$
• $1 \le R_2 \le 10^4$

For each test case, print PACKING GOOD on its own line if a good packing exists, and PACKING BAD otherwise.

The first test case of the first example can be packed like this.