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:
def digsum(nc,s):
    sodfun=0
    while nc>0:
        sodfun+=(nc%10)
        nc=nc//10
    if sodfun<=s:
        return True
    else:
        return False


for t in range(int(input())):
    n,s=[int(k) for k in input().split()]
    sod=0
    dig=0
    nc=n
    while nc>0:
        sod+=nc%10
        dig+=1
        nc=nc//10
    #print(sod)
    if sod<=s:
        print(0)
    else:
        nc=n
        exp=1
        for i in range(1,dig+2):
            exp*=10
            rem=nc%10
            nc=nc//10
            nd=(nc+1)
            #print(nd)
            if digsum(nd,s):
                print(nd*exp-n)
                break