spoj#DIV15. Divisibility by 15
Divisibility by 15
There is a string containing only decimal digit characters. The length of the string is between 1 and 1000. Using characters of the string, you have to construct the maximum number which divides by fifteen without remainder. Each character of the string may not be used more than once.
Input
First line of input contains an integer t (1 ≤ t ≤ 90), equal to the number of testcases. Then descriptions of t testcases follow.
Each testcase is described in a single line representing the source string.
Output
For each testcase output one line with the decimal representation of the maximum number. Leading zeroes should be omitted. If no number can be constructed, output a single word “impossible”.
Example
Input: 1 02041 Output: 4200