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:
T=int(input())
for _ in range(T):
    n,s=list(map(int,input().split()))
    a=list(map(int,str(n)))
    a=a[::-1]
    if sum(a)<=s:
        print(0)
        continue
    ans=0
    i=0
    n=len(a)
    while sum(a)>s and i<n:
        ans+=(10-a[i])*(10**i)
        a[i]=0
        if i+1>=n:
            a.append(0)
        a[i+1]=a[i+1]+1
        i+=1
    print(ans)