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:
for _ in range(int(input())):
    n,s=map(int,input().split())
    ans=0
    x=n
    l=0
    while(x):
        x=x//10
        l+=1
    a=[0]*(l+1)
    j=l
    x=n
    while(x):
        a[j]=x%10
        x=x//10
        ans+=a[j]
        j-=1
    res=0
    for i in range(l,0,-1):
        if ans>s:
            res=res+(10-a[i])*pow(10,l-i)
            j=i-1
            ans=ans-a[i]
            while(j>0 and a[j]==9):
                a[j]=0
                j-=1
                ans-=9
            a[j]+=1
            ans+=1
        else:
            break
    print(res)