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:
t = int(input())
for _ in range(t):
    s, n = map(str, input().split())
    n = int(n)
    m = len(s)
    pos = -1
    temp = 0
    tt = 0
    for i in range(0, m):
        tt += ord(s[i])-ord('0')
    if tt <= n:
        print(0)
        continue
    for i in range(0, m):
        ch = ord(s[i])-ord('0')
        if temp+ch < n:
            temp += ch
        else:
            pos = i
            break
    ans = ''
    flag = True
    for i in range(m-1, pos-1, -1):
        if flag:
            ans += chr((ord('9')-ord(s[i])+1)%10+ord('0'))
        else:
            ans += chr(ord('9')-ord(s[i])+ord('0'))
        if s[i] != '0':
            flag = False
    finans = ''
    flag = False
    for i in range(len(ans)-1, -1, -1):
        if ans[i] != '0':
            flag = True
        if flag:
            finans += ans[i]
    print(finans)