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:
def solve(x,n):
    sm = 0
    for i in range(n+1):
        sm += int(x[i])
    return sm
    
t = int(input())
for _ in range(t):
    n,s = map(int,input().split())
    st = str(n)
    i = 0
    sm = 0
    while(i < len(st) and sm + int(st[i]) < s):
        sm += int(st[i])
        i += 1
    if i == len(st):
        print(0)
        continue
        
    new = ''
    x = 10
    for j in range(len(st)-1,i,-1):
        if x - int(st[j]) == 10:
            new = '0' + new
        else:
            new = str(x - int(st[j])) + new
            x = 9
        
    j = 0
    while( j <= 9):
        sd = solve(str(n +int(str(j)+ new)),i)
        if sd <= s:
            print(int(str(j)+ new))
            break
        j += 1