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 x in range(t):
    
    number,s = input().split(" ")
    s = int(s)
    sum = 0
    for i in number:
        sum += int(i)
    diff = sum - s
    answer = ''
    number = number[::-1]
    number = list(number)
    for key,i in enumerate(number):
        if diff>0 and int(i)>0:
            diff-=int(i)
            answer += str(10-int(i))
            if key != len(number)-1:
                number[key+1] = str(int(number[key+1])+1)
                diff += 1
        elif diff>0 and int(i)==0:
            answer+=i
        else:
            break
    answer = answer[::-1]
    if answer == "":
        print(0)
    else:
        answer = int(answer)
        print(answer)