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=[int(c) for c in input().split()]

    strn = str(n)

    totalsum = 0
    for i in strn:
        totalsum+=int(i)
    

    if totalsum <= s:
        print(0)
        continue
    

    strn = [int(i) for i in strn[::-1]]
    strn.append(0)
    # print(strn)

    finalans = 0
    x = 1
    init = 0
    for i in range(len(strn)-1):
        ##make this digit to zero
        digit = int(strn[i])
        strn[i] = 0 
        strn[i+1]+=1
        finalans = finalans + x*(10 - digit)
        x*=10
        if sum(strn) <=s :
            break
    print(finalans)