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(str,input().split())
    s=int(s)
    f=[int(i) for i in n]
    r,j="",-1
    m,d,o=0,"",0
    for i in range(len(n)):
        if o==0:
            m+=int(n[i])
            if(m>=s):
                o=1
                j=i
                break
    if(j==-1 or (i==len(n)-1 and m<=s) or (sum(f)<=s)): print("0")
    else:
        k=0
        for i in range(len(n)-1,j-1,-1):
            if k==0:
                if n[i]=='0':
                    d+="0"
                else:
                    d+=str(10-int(n[i]))
                    k=1
            else:
                d+=str(9-int(n[i]))
        
        if d[-1]=='0':
            w=d[::-1]
            o,a=0,0
            for i in range(len(w)):
                if w[i]=='0': a+=1
                else:
                    if i==a:
                        d=w[i:]
                        d=d[::-1]
                        break
        print(d[::-1])