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 = 1
t = int(input())

for _ in range(t):
    n,s = map(int, input().split())
    su = 0
    arr = []
    for i in str(n):
        su += int(i)
        arr.append(int(i))
        
    if(su<=s):
        print(0)
        continue
    else:
        arr = arr[::-1]
        ptr = 0
        #print(arr)
        while(su>s):
            tmp = arr[ptr]
            su -= tmp
            su += 1
            arr[ptr] = 0
            if(tmp==0):
                ptr+=1
                continue
            if(ptr>20):
                break
            if(ptr<len(arr)-1):
                arr[ptr+1] += 1
                for i in range(len(arr)-1):
                    if(arr[i]>=10):
                        arr[i+1] += (arr[i]-9)
                        arr[i] = 0
                if(arr[-1]>=10):
                    arr.append(arr[-1]-9)
                    arr[-2] = 0
            else:
                arr.append(1)
            su = 0
            for i in arr:
                su += i
            ptr+=1
            
        #print(arr)
        ans = ''
        arr = arr[::-1]
        for i in arr:
            ans += str(i)
        print(int(ans)-n)