Problem: You are given a positive integer n. In one move, you can increase n by one (i.e. make n := n + 1). Your task is to find the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 2 ⋅ 10^4) — the number of test cases. Then t test cases follow.

The only line of the test case contains two integers n and s (1 ≤ n ≤ 10^{18}; 1 ≤ s ≤ 162).

Output

For each test case, print the answer: the minimum number of moves you need to perform in order to make the sum of digits of n be less than or equal to s.

Example

Input


5
2 1
1 1
500 4
217871987498122 10
100000000000000001 1


Output


8
0
500
2128012501878
899999999999999999

Solution (in PYTHON3):

Solution:
for _ in range(int(input())):
    n,s=input().split()
    s=int(s)
    sum,second_sum,k=0,0,0
    for i in n:
        sum+=int(i)
    if sum<=s: print(0)
    elif int(n[0])>=s: print(int('1'+len(n)*'0')-int(n))
    else:
        for i in n:
            if second_sum == s:
                new = str(int(n[:k - 1]) + 1) + '0' * (len(n) - k + 1)
                print(int(new) - int(n))
                break
            elif second_sum>s or second_sum+int(i)>s:
                new=str(int(n[:k])+1)+'0'*(len(n)-k)
                print(int(new)-int(n))
                break
            else:
                second_sum+=int(i)
                diff=s-second_sum
                k+=1