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:
import math
t=int(input())
for w in range(t):
    n,s=(int(i) for i in input().split())
    s1=str(n)
    k=len(s1)
    s2=0
    for i in s1:
        s2+=int(i)
    if(s2<=s):
        print(0)
    else:
        if(k==1):
            print(10-n)
        else:
            c=0
            s3=0
            for i in range(k-1,0,-1):
                s3+=int(s1[i])
                if(int(s1[i-1])!=9):
                    if(s2-s3+1<=s):
                        c=1
                        k2=i-1
                        break
                else:
                    continue
            if(c==1):
                j=s1[:k2]+str(int(s1[k2])+1)+'0'*(k-k2-1)
                print(int(j)-n)
            else:
                j='1'+'0'*k
                print(int(j)-n)