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 = map(int,input().split())
    
    st = ('0'*(19-len(str(n))))+str(n)
    sm = 0
    for i in st:
        sm+=int(i)
    moves = 0
    if(sm<=s):
        print(moves)
        continue
    else:
        diff = sm-s
        st = st[::-1]
        pw = 1
        prof = int(st[0])-1
        st_t = st[0]
        moves = (10-(int(st_t)))
        pw+=1
        for i in range(1,len(st)):
            if(prof>=diff):
                break
            st_t+=st[i]
            prof+=int(st[i])
            moves = ((10**pw)-int(st_t[::-1]))
            pw+=1
        print(moves)