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
import math
# sys.stdin  = open("input.txt")
for _ in range(int(input())):
    n,s=input().split()
    n1=int(n)
    n=list(n)
    n=["0"]+n
    ln=len(n)
    s1=0
    s=int(s)
    for i in n:
        s1+=int(i)
    if s1<=s:
        print(0)
        continue
    for i in range(ln-1,-1,-1):
        flag=0
        s1-=int(n[i])
        for j in range(int(n[i])+1,10):
            if s1+j<=s:
                n[i]=str(j)
                flag=1
                break
        if flag==1:
            break
        n[i]="0"
    print(int("".join(n))-n1)