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:
m=int(input())
for i in range(m):
    n,s=map(int,input().split(' '))
    summat=int(0)
    r=n
    rnt=int(0)
    mov = int(0)
    mov1=int(0)
    while r:
        summat += r % 10
        r //= 10
        rnt+=1
    if summat<=s:
        print('0')
    else:
        for jj in range(rnt):
            if jj==0:
               dig=n%10
            else:
               dig=(n//(10**jj))%10
            j = n
            summat = 0
            while j:
               summat += j % 10
               j //= 10
            if summat <= s:
                break
            if dig == 0:
                continue
            mov=((10 - dig) % 10) * (10 ** jj)
            n=n+mov
            mov1+=mov
        print(mov1)