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:
import sys
from itertools import permutations
from itertools import combinations
from itertools import combinations_with_replacement
#sys.stdin = open('/Users/pranjalkandhari/Desktop/Template/input.txt', 'r')

for _ in range( int(input()) ):
    liStr = input().split()
    n = int(liStr[0])
    s = int(liStr[1])

    sInitial = 0
    nStrOK = str(n)
    for i in nStrOK:
        sInitial += (int(i))
    if(sInitial<=s):
        print("0")
        continue

    nStr = str(n)
    nLen = len(nStr)
    ans = pow(10,(nLen))-n

    ctr=0
    while(ctr<nLen):
        p1 = nStr[0:ctr+1]
        intP1 = int(p1)+1
        p2 = nStr[ctr+1:]
        comp = intP1*(pow(10,len(p2)))
        strComp = str(comp)
        sCur = 0
        for i in strComp:
            sCur += (int(i))
        if(sCur<=s):
            ans = comp-n
        ctr += 1
    print(ans)