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:
for _ in range(int(input())):
    n, s = input().split()
    s = int(s)
    check = 0
    x = len(n)
    ans = n
    for i in range(x):
        check += ord(n[i]) - ord('0')
        if check == s:
            if i == x-1 or int(n[i+1:]) == 0:
                ans = n
                break
            else:
                if i != 0:
                    if n[i - 1] != '9':
                        ans = n[:(i - 1)] + str(int(n[i - 1]) + 1) + '0' * (x - i)
                    else:
                        temp = ''
                        c = 1
                        for g in reversed(range(0, i)):
                            if n[g] == '9' and c == 1:
                                temp += '0'
                            else:
                                if c == 1:
                                    temp += str(int(n[g]) + 1)
                                else:
                                    temp += n[g]
                                c = 0
                        ans = temp[::-1] + '0' * (x - i)
                else:
                    ans = '1' + '0'*x
                break
        elif check > s:
            if i != 0:
                if n[i-1] != '9':
                    ans = n[:(i-1)] + str(int(n[i-1])+1) + '0'*(x-i)
                else:
                    temp = ''
                    c = 1
                    for g in reversed(range(0, i)):
                        if n[g] == '9' and c == 1:
                            temp += '0'
                        else:
                            if c == 1:
                                temp += str(int(n[g]) + 1)
                            else:
                                temp += n[g]
                            c = 0
                    ans = temp[::-1] + '0'*(x-i)

            else:
                ans = '1' + '0'*x
            break
    p = int(ans) - int(n)
    if p < 0:
        ans = '1' + ans
        print(int(ans) - int(n))
    else:
        print(p)