Problem B - Special Numbers
---------------------------

We are looking for numbers with very special properties -- each number
must have the property that the sum of its four digits equals the sum of
its digits (in decimal notation) when represented in hexadecimal (base
16) notation and also equals the sum of its digits when represented in
duodecimal (base 12) notation.

For example, the number 2991 has the sum of (decimal) digits 2+9+9+1 =
21.  Since 2991 = 1*1728 + 8*144 + 9*12 + 3, its duodecimal
representation is 1893, and these digits also sum up to 21.  But in
hexadecimal 2991 is BAF, and 11+10+15 = 36, so 2991 should be rejected
by your program.

The next number (2992), however, has digits that sum to 22 in all three
representations (including BB0 in hexadecimal), so 2992 is a special
number.

Input
-----

The input consists of several pairs of integers (a b), one pair on each 
line. The last line of input has 0 0.

Output
Your output is all the numbers (in decimal notation) between a and b
(both inclusive) that satisfy the requirements (in strictly increasing
order), each on a separate line with no leading or trailing blanks,
ending with a new-line character.  There are to be no blank lines in the
output.

Sample Input
------------

2991 3000
0 0 

Output for Sample Input
-----------------------

2992
2993
2994
2995
2996
2997
2998
2999