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 su(x):
    s=0
    for d in x:
        s+=int(d)
    return s
for _ in range(int(input())):
    n,s=input().split()
    s=int(s)
    if su(n)<=s:
        print(0)
    else:
        le=len(n)+1
        ans=["0"]
        for d in n:
            ans.append(d)
        while le>0:
            ans[le-1]="0"
            k=le-1
            fl=1
            while fl==1:
                if ans[k-1]=="9":
                    ans[k-1]="0"
                    k-=1
                else:
                    ans[k-1]=str(int(ans[k-1])+1)
                    fl=0
            if su(ans)<=s:

                st="".join(ans)
                print(int(st)-int(n))
                break
            else:
                le-=1