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(input().split())
    s=int(s)
    p=len(n)
    ncopy=n[::-1]
    ncopy=ncopy+"000000000000000000"
    ncopy=list(ncopy)
    summ=0
    for j in n:
        summ+=(int(j))
    if(summ<=s):
        print(0)
        continue
    diff=summ - s
    # print(diff)
    for i in range(p):

        cur=int(ncopy[i])
        if(cur==0):
            continue
        diff=diff-cur
        ncopy[i]='0'
        j=1
        # print(diff)
        while(True):
            nc=int(ncopy[i+j])
            if(nc!=9):
                nc=nc+1
                ncopy[i+j]=str(nc)
                diff=diff+1
                break
            else:
                ncopy[i+j]='0'
                diff-=9
                j+=1
        if(diff <= 0):
            break
    ans=[]
    ncopy=ncopy[::-1]
    st=0
    # print(ncopy)
    for j in ncopy:
        if(st==1):
            ans.append(j)
            continue
        if(int(j)!=0):
            st=1
            ans.append(j)
        
    print(int("".join(ans)) - int(n) )