Ganesh lives in Gopalmath. He is looking for Jojo. So he decides to collect Aadhar Card Information of all the citizens of India from UIDAI.
Someone told Ganesh that the sum of all the digits of Jojo’s Aadhar number is divisible by 10 and it is greater than zero. After finding all Aadhar numbers which are divisible by 10, Jojo’s Aadhar number is $N$th smallest Aadhar number. Hence, Ganesh wants to find Jojo’s  Aadhar number which satisfies all of the above conditions. (In this chaotic world, Aadhar numbers can be any natural number.)
However, Guruji refused Ganesh to carry out this task, because he is weak in Maths. Therefore, Ganesh assigns this task to Paritoshbhai who possesses excellent Mathematical skills. Since Paritoshbhai is busy in his jewellery business, help him in this task.

-----Input:-----
- The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
- The first and only line of each test case contains a single integer N.

-----Output:-----
For each test case, print a single line containing Aadhar number of Jojo.

-----Constraints-----
- $1 \leq T \leq 1000$
- $1 \leq N \leq 10^{100,000}$

-----Sample Input:-----
1
3

-----Sample Output:-----
37

Starter code:

Solutions:
for _ in range(int(input())):
 N = input()
 num = list(N)
 s=0
 for n in num:
  if n.isnumeric():
   s+=int(n)
 #print(s)
 x=(10-s%10)%10
 print(int(N)*10+int(x))

# cook your dish here
def s(n):
 sn=str(n)
 r=0
 for i in sn:
  r+=int(i)
 return r
  
for _ in range(int(input())):
 n=int(input())
 print(str(n)+str((10-s(n))%10))

for _ in range(int(input())):
 n = input().strip().lstrip('0')

 x = sum(int(i) for i in n) % 10

 if x == 0:
  x = 10

 print(str(n) + str(10 - x))