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 sum_of(x):
    cnt=0
    while x:
        cnt+=x%10
        x//=10
    return cnt


from collections import Counter
for _ in range(int(input())):
    n,s= map(int, input().split())
    if sum_of(n)<=s:
        print(0)
    else:
        dd=sum_of(n)
        cnt=0
        ans=0
        n=list(str(n))[::-1]
        #print(n)
        carry=0
        for i in n:
            if int(i)+carry==0:
                cnt += 1
                continue

            else:
                ans+=(10-(int(i)+carry))*10**cnt
                dd -= (int(i) + carry)
                dd+=1
                carry=1
                cnt+=1


            if dd<=s:
                break
        print(ans)