INUMBER  Interesting number
For the given number n find the minimal positive integer divisable by n, with the sum of digits equal to n.
Input
t – the number of test cases, then t test cases follow. (t <= 50)
Test case description:
n  integer such that 0 < n <= 1000
Output
For each test case output the required number (without leading zeros).
Example
Input: 2 1 10 Output: 1 190
hide comments
Ruslan:
20090712 10:43:54
how mach the answer can be?

Added by:  Roman Sol 
Date:  20050113 
Time limit:  7s 
Source limit:  4096B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  XII team championship of St.Petersburg in programming 