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:

from math import log2, ceil
from heapq import heappush, heappop, heapify
from copy import deepcopy
from collections import deque, Counter as CC
def main():
# Enter your code here. Read input from STDIN. Print output to STDOUT
    for t in range(int(input())):
        # m= int(1e9+7)
        # n = int(input())
        n,d = [int(j) for j in input().split()]
        s = [int(j) for j in str(n)]
        m = len(s)
        if(sum(s)<=d):
            print(0)
            continue
        ct = 0
        s = [0]+s
        flag = True
        for i in range(m):
            if(flag):
                if(d-s[i]-ct<=s[i+1]):
                    s[i] = 1+s[i]
                    if(s[i]==10 and i>0):
                        cur = i
                        while(cur>=0):
                            if(s[cur]<9):
                                s[cur]+=1
                                break
                            s[cur] = 0
                            cur-=1
                    flag = False
                else:
                    ct+=s[i]
            else:
                s[i] = 0

        s[-1] = 0
        # print(s)
        print(int("".join(map(str,s)))-n)





        # print(s[n-1]*n)
        # p,f = [int(j) for j in input().split()]
        





        


        



if __name__ == "__main__":
    main()