Time Limit: 1000 MS Memory Limit: 65536 K
You are given a original number N.
Can you tell me the smallest non-negative integer that can be added to N
such that the resulting integer contains at least two digits K.
The first line of the input data will be a integer to represent the number of test cases.
For each case there is only one line contains two integers N and K.
( 0 <= N < 10^10000 , 0 <= K <= 9 )
There is a blank line before each test case.
For each test case output the answer on a single line:
the smallest non-negative integer.