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:
'''
Name : Jaymeet Mehta
codeforces id :mj_13
Problem : 
'''
from sys import stdin,stdout
test=int(stdin.readline())
for _ in range(test):
    n,s=map(int,stdin.readline().split())
    n=[int(x) for x in list(str(n))]
    n=n[::-1]
    if sum(n)<=s:
        print(0)
        continue
    ans=0
    sm=sum(n)
    for i in range(len(n)):
        if sm<=s:
            break
        if n[i]==0:
            continue
        ans+=(10-n[i])*10**(i)
        n[i]=0
        if i!=len(n)-1:
            n[i+1]+=1
        sm=sum(n)
    print(ans)