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:
# import sys
# sys.setrecursionlimit(10**7)

# def input(): return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def readInt():return int(input())
def readIntList():return list(map(int,input().split()))
def readStringList():return list(input())
def readStringListWithSpace():return list(input().split())
def readString():return input()

def getNumSum(n):
    res = 0
    while n > 0 :
        res += n%10
        n //= 10
    return res

t = readInt()
for _ in range(t):
    n,s = readIntList()
    if getNumSum(n) <= s:
        print(0)
        continue
    ans,pw = 0,1
    for i in range(19):
        dig = (n//pw)%10
        temp = pw * ((10-dig)%10)
        n+=temp
        ans += temp
        if(getNumSum(n) <= s):
            print(int(ans))
            break
        pw *= 10
        

# # import sys
# # sys.setrecursionlimit(10**7)

# # def input(): return sys.stdin.readline()[:-1]
# mod = 10**9 + 7
# def readInt():return int(input())
# def readIntList():return list(map(int,input().split()))
# def readStringList():return list(input())
# def readStringListWithSpace():return list(input().split())
# def readString():return input()

# t = readInt()
# for _ in range(t):
#     n,s = readIntList()
#     n = list(map(int,list(str(n))))
#     res = 0
#     while n and sum(n)+res > s :
#         dig = n.pop()
#         res += ((10-dig)%10)
#     print(res)