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, su = map(int, input().split())
    s = str(n)
    summ = 0
    ss = []
    for i in range(len(s)):
        summ += int(s[i])
    if (summ <= su):
        print(0)
    else:
        summ = 0
        for i in range(len(s)):
            if int(s[i]) + summ < su:
                summ += int(s[i])
                ss.append(s[i])
            else:
                for j in range(i, len(s)):
                    ss += ['0']
                ch = i - 1
                while ch > -1 and ss[ch] == '9':
                    ss[ch] = '0'
                    ch -= 1
                if ch == -1:
                    ss = ['1'] + ss
                else:
                    ss[ch] = str(int(ss[ch]) + 1)
                ans = ''
                for q in range(len(ss)):
                    ans += ss[q]
                print(int(ans) - n)
                break