JMU F18 Week 12

#### Start

2018-11-16 19:30 UTC

## JMU F18 Week 12

#### End

2018-11-23 19:30 UTC
The end is near!
Contest is over.
Not yet started.
Contest is starting in -391 days 17:14:43

168:00:00

0:00:00

# Problem ALeft Beehind

Beekeeper Bill is ready to go to the annual beekeeper’s convention with his friends. Bill packed his honey in jars, but unfortunately the honey in some of the jars has turned sour. Bill’s friends are mean, and if too much of Bill’s honey is sour they will go to the convention without him.

If Bill has more jars of sour honey than sweet, he will be left “beehind”. If Bill has more jars of sweet honey than sour he will go to the convention. If Bill has the same number of sweet and sour jars, his friends are undecided. Lastly, Bill’s friends are superstitious, if he has exactly 13 jars they will never speak to him again. Bill needs new friends.

## Input

Input consists of multiple cases, each on its own line. Each case consists of two integers $x$ and $y$ ($0 \le x, y \le 1000$), which are the number of sweet and sour jars Bill has, respectively. Input is terminated by a line containing two zeros, which should not be processed. There may be up to $15$ test cases in the input.

## Output

For each case, output one of the following results on its own line (without quotes).

• “Left beehind.” (note the spelling, those punsters)

• “Undecided.”

• “To the convention.”

• “Never speak again.”

If Bill’s friends will never speak to him again, that is most important and should be the only output.

Sample Input 1 Sample Output 1
17 3
13 14
8 5
44 44
0 0

To the convention.
Left beehind.
Never speak again.
Undecided.