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:
def process(n,s):
    n='0'+n
    n1=list(n)
    n=list(n)
    t=0
    while(sum([int(i) for i in n])>s):
        t=0
        # print(sum([int(i) for i in n]),n)
        for i in range(1,len(n)):
            t+=int(n[i])
            if(t<=s):
                continue
            else:
                n2='0'+str(int("".join(n[:i-0]))+1)
                for i1 in range(i,len(n)):
                    n2+='0'
                n=list(n2)
                break
    # print(n)
    return (int("".join(n))-int("".join(n1)))




def brute(n,s):
    n='0'+n
    ans=0
    while(sum([int(i) for i in n])>s):
        n=str(int(n)+1)
        ans+=1
    return ans

import random
tests=int(input())
for i in range(tests):
    n,s=input().split()
    # n=str(random.randint(1,10**18))
    # s=random.randint(1,163)
    s=int(s)
    # print(n,s)
    t1=process(n,s)
    print(t1)
    # t2=brute(n,s)
    # if(t1!=t2):
    #     print(n,s,t1,t2)