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())
    n=str(n)
    n=list(n)
    for i in range(0,len(n)):
        n[i]=int(n[i])
    a=sum(n)
    if a<=s:print(0)
    else:
        n.reverse()
        ans=0
        if 9 in n and n.count(9)==len(n):print(1)
        else:
            for i in range(0,len(n)):
                if a<=s:break
                elif n[i]==0:continue
                elif i==(len(n)-1) and n[i]==1:break
                else:
                    ans+=(10**i)*(10 - n[i])
                    n[i]=0
                    if i!=len(n):
                        car=1
                        for j in range(i+1,len(n)):
                            if n[j]==9:
                                n[j]=0;car=1
                            else:
                                n[j]+=1;car=0
                                break
                        if car==1:n.append(1)
                    a=sum(n)
                        
            print(ans)