A. Three kings
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Three kings: Barley, Hops and Malt brought their troops to the military review. The Emperor of the Beer Empire wants to know which of the kings has more warriors, but he cannot count. Emperor's advisers reported that Barley has $$$a$$$ regiments of $$$x$$$ warriors each, Hops has $$$b$$$ regiments of $$$y$$$ warriors each, and Malt has $$$c$$$ regiments of $$$z$$$ warriors each. Alas, the aged emperor forgot even the simplest arithmetic operations... Help him!

Input

The only line contains 6 integers: $$$a, b, c, x, y, z$$$ ($$$1 \le a, b, c, x, y, z \le 10^3$$$) — the number of regiments of Barley, Hops, Malt, and the number of warriors in them, respectively.

Output

If the king with the strongest army has $$$x$$$ warriors, on a single line print the names of all kings with $$$x$$$ warriors separated by spaces in lexicographical order.

Examples
Input
2 4 3 6 3 4
Output
Barley Hops Malt
Input
2 3 3 6 3 4
Output
Barley Malt