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:
n = int(input())
def check(n, s):
    suma = 0
    for i in range(len(n)):
        suma += int(n[i])
    return True if suma <= s else False
for i in range(n):
    n, s = map(int, input().split())
    n = str(n)
    ans = '0'
    suma = 0
    curlen = len(n)
    if not check(n, s):
        for i1 in range(len(n)):
            if int(n[i1]) + suma < s :
                suma += int(n[i1])
                ans += n[i1]
                curlen -= 1
            else:
                start = 0
                for i2 in range(len(ans) - 1, -1, -1):
                    if ans[i2] !='9':
                        start = i2
                        break
                    else:
                        curlen += 1
                ans = ans[:start] + str(int(ans[start]) + 1) + '0' * curlen
                break
        print(int(ans) - int(n))
    else:
        print(0)