SPCQ  Gopu and Digits Divisibility
One day Little Gopu was playing with numbers. As he is little boy, he was wondering about divisibility rules that how they apply and what is the logic behind them. Few days ago he has also learnt how to find sum of digits of a number.
He thought about finding the smallest number greater than or equal to n, which is a "nice" number. A number is called "nice" if it is divisible by sum of its digits. He is unable to solve this puzzle. Can you write a program to help the Little Gopu?
eg. if n = 11, 11 is not divisible by 1 + 1 = 2, But 12 is divisible by 1 + 2 = 3. So answer for case n = 11 should be 12.
Input
First line contains T : number of test cases. (1 <= T <= 10^4).
For each test case, It contains a single integer n in a line, (1 <= n <= 10^18).
Output
For each test case, output the smallest "nice" number greater or equal to n.
Example
Input: 3
11
22
2 Output: 12
24
2
hide comments
ameyanator:
20180925 19:51:06
well just do what the question says implementation question 

aadarsh45:
20180831 15:36:51
simple one.. 

wrzoboo:
20180730 15:15:26
Test cases and time limit weak enough to accept naive python 3 solution.


sherlock11:
20180202 05:33:04
very weak test cases 

zeeshan12:
20180112 10:05:13
brute force is enough! ac in on go 

coder_vikram:
20171212 20:06:38
Last edit: 20171212 20:07:20 

venky1001:
20170604 16:37:35
100th :D :D 

ankit1cool:
20170603 19:25:28
simple brute force got accepted 

sachinsharma12:
20170124 07:16:49
Easy one)) 

anurag_lal1:
20170102 19:32:58
My 50th :) 
Added by:  praveen123 
Date:  20131226 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  IITK ACA CSE online judge 