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())):
    a,b=map(int,input().split())
    bb=b
    can=0
    d=10000000000000000000
    while(d>0):
        bb=bb-(a//d)%10
        d=d//10
    if(bb>=0):
        can=1
    d=10000000000000000000
    t=0
    while(d>0 and b-(a//d)%10>=1):
        b=b-(a//d)%10
        t=(a//d+1)*d
        d=d//10
    if(can):print(0)
    else:print(t-a)
    t=0