Filling Out the Team

Time limit1sMemory limit128 MB

Problem

Over the years, the people of the great city of Pittsburgh have repeatedly shown football expertise second to none. A spy recently discovered the true source of the city's football power: a wizard known only as "Myron," who is infallible at choosing the position at which each player will excel.

Now that you know the secret, you set out to give your school's football team a program that matches Myron's wisdom. After consulting the best football minds you could find, you compiled the slowest speed, minimum weight, and minimum strength required to play each position.

PositionSlowest SpeedMin. WeightMin. Strength
Wide Receiver4.5150200
Lineman6.0300500
Quarterback5.0200300

Using this table, write a program that reads several players' physical attributes and reports which position(s) each of them can play.

Input

Each line lists the attributes of one player:

<speed> <weight> <strength>

The three values are space-separated real numbers giving the player's speed, weight, and strength. The input ends with a line reading 0 0 0, which is not a player.

Output

For each player, print on its own line the positions that player can play. A player can play a position when all of the following hold:

  • the player's speed is less than or equal to that position's slowest speed,
  • the player's weight is greater than or equal to that position's minimum weight, and
  • the player's strength is greater than or equal to that position's minimum strength.

List the playable positions in the order given in the table (Wide Receiver, Lineman, Quarterback), separated by a single space and with no trailing space. If a player can play no positions, print No positions.