Eeny Meeny

In a faraway land there lived a tribe called the "Eeny Meenys". They got this name from the way they chose a chief each year. The tribe had no permanent chief; a chief's term was exactly one year. At the end of that time they ate the current chief and chose another.

Their method of choosing a chief was the "Eeny meeny miny mo" method. All eligible tribal members (women were eligible too) stood in a circle. A starting place was chosen, and the chief medicine man (who was ineligible for chieftainship) went around the circle counting off the following 15 syllables in order:

E, e, n, y, M, e, e, n, y, M, i, n, y, M, o!

At every "o!" (that is, every 15th syllable) the person indicated was pushed out of the circle. The circle then closed up and the count restarted with that person's neighbour (the one who would have been "E" anyway). This continued until only one person was left — the new chief.

While a year of glory makes the job attractive, you find the brevity of that glory unappealing. You have found out that this year the count will start with Mxgobgwq (a very large person), so you would like to know where not to stand. You do not know the direction of counting, nor exactly how many eligible people there are, but you can estimate the number (it is certainly less than 500).

Numbering the positions from Mxgobgwq (position 1), write a program that determines the position closest to Mxgobgwq (the smallest position number) that will never be chosen as chief — for every possible number of people in the given range and for either direction of counting (clockwise or anti-clockwise).

The input consists of several lines. Each line contains two integers: the upper and lower estimates of the number of eligible people (both inclusive). The input is terminated by a line containing two zeroes (0 0).

For each line of input, print one line. Each line contains the number of the position closest to Mxgobgwq that will not be chosen as chief for any number of people in the given range and for either direction of elimination. If no position is safe, print Better estimate needed.