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 checkSum(num,s):
    temp = str(num)
    c = 0
    for i in temp:
        c += int(i)
    if c <= s:
        return True
    return False

def solve(num,s):
    temp = num
    c = 0
    while num != 0:
        num = num//10
        c += 1
        num += 1
        if checkSum(num,s):
            break
    num = num*10**(c)
    val = num-temp
    # print(num,c,val)
    return val


# num, s = 217871987498122, 10
# num,s = 100000000000000001 ,1
for _ in range(int(input())):
    num,s = list(map(int,input().split()))
    if checkSum(num,s):
        print(0)
    else:
        print(solve(num,s))