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 i in range(int(input())):
    n, s = map(int,input().split())
    n = str(n)
    e = []
    for a in range(len(n)):
        e.append(int(n[a]))
        
    
    if sum(e) <= s:
        print(0)
    else:
        t = 0
        for b in range(len(e)):
            y = len(e)-b-1
            if sum(e)<=s:
                l = 0
            
            elif e[y] != 0:
                    j = (10-e[y])*(10**b)
                    
                    t+=j
                    e[y] = 0
                    if b+1!= len(e):
                        if e[y-1]!= 9:
                            e[y-1] +=1
                        else:
                            e[y-1] = 0
                            e[y-2]+=1
        print(t)