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 su(tmp):
    ans=0
    for i in tmp:
        ans+=int(i)
    return ans
for _ in range(int(input())):
    n,s = map(int,input().split())
    tmp=list(str(n))
    a=su(tmp)
    if s>=a:
        print(0)
    else:
        aa=ans=0
        c=1
        tmp=['0']+tmp
        for i in range(len(tmp)-1,0,-1):
            if tmp[i]=='0':
                c*=10
                continue
            aa += int(tmp[i])
            ans+=(10-int(tmp[i]))*c
            tmp[i]='0'
            j=i-1
            while j>=0 and tmp[j]=='9':
                tmp[j]='0'
                j-=1
            tmp[j]=str(int(tmp[j])+1)
            c*=10
    #        print(tmp,aa,a,ans,a-aa+1,su(tmp))
            if su(tmp)<=s:
                break
    #    print(a,aa,s,ans)
        if su(tmp)>s:
            ans+=(10-int(tmp[i]))*c
        print(ans)