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:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]

def cal(n,add):
    global nn
    n = int(''.join(n))+add
    nn = list(str(n))
    return sum(list(map(int,str(n))))

for _ in range(inp()):
    n,k = ip()
    nn = list(str(n))
    if cal(nn,0) <= k:
        print(int(''.join(nn))-n)
        continue
    for i in range(len(nn)-1,-1,-1):
        add = (10-int(nn[i]))*(10**(len(nn)-1-i))
        if cal(nn,add) <= k:
            print(int(''.join(nn))-n)
            break