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:
x=int(input())
for z in range(x):
    n1,s=input().split()
    n=n1
    s=int(s)
    sm=0
    for k in range(len(n)):
        sm=sm+int(n[k])
    if sm<=s:
        print(0)
    else:
        if int(n[0])>=s or n[0]=='9':
            n='0'+n
        n=list(n)
        bruh=0
     
        i=0
        while(bruh<s) and i<len(n):
            bruh+=int(n[i])
            i+=1
            #print(bruh,i)
        i=i-2
        while n[i]=='9':
            n[i]='0'
            i=i-1
        n[i]=str(int(n[i])+1)  
     
        for a in range(i+1,len(n)):
            n[a]='0'
        #print(n)
        c="".join(n)
        print(int(c)-int(n1))