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 tc in range(t):
    s1, n = input().split(' ')
    n = int(n)
    ans = 0
    s = list(s1)
    for i in s:
        ans += int(i)
    if ans <= n:
        print(0)
        continue
    else:
        dig = []
        for i in s:
            dig.append(i)
        sz = len(dig)
        ptr = sz - 2
        while ptr >= 0:
            dig[ptr] = str(int(dig[ptr + 1]) + int(dig[ptr]))
            ptr -= 1
        ptr = sz - 2
#       print(dig)
        while ptr >= -1:
            if ans - int(dig[ptr + 1]) + 1 <= n:
                break
            ptr -= 1
        while ptr >= 0 and s[ptr] == '9':
            ptr -= 1
        if ptr == -1:
            ptr = 1
            nn = ['1']
            nn += s
            while ptr <= sz:
                nn[ptr] = '0';
                ptr += 1
            nn1 = ""
            nn1 = nn1.join(nn)
            print(int(nn1) - int(s1))
        else:
            nn = s
            nn[ptr] = str(int(nn[ptr]) + 1)
            ptr += 1
            while ptr < sz:
                nn[ptr] = '0'
                ptr += 1
            nn1 = ""
            nn1 = nn1.join(nn)
            print(int(nn1)- int(s1));