Given two integers X and K. The task is to find smallest K-digit number divisible by X.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains two integers X and K as input. It is given that number of digits in X is always smaller or equal to K.
For each test case, print smallest K-digit number divisible by X in new line .
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.