Find the smallest number such that the sum of its digits is N and it is divisible by.
The first line contains an integer T, number of test cases. For each test case, there is an integer N.
For each test case, the output is the smallest number according to question.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.