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):
    a, b=map(int, input().split())
    s=0
    ans=0
    a=str(a)
    n=len(a)
    all=0
    for i in range(n):
        s+=int(a[i])
        if a[i]==0: j+=1
        if s>=b:
            ans=10**(n-i)-int(a[i:])
            if i<n-1: all=s+int(a[i+1:])
            elif i==n-1: all=s
            break
    if all==b:
        ans=0
    print(ans)