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 pathlib import Path
import sys
import functools
import itertools
import re

def ok(val,s):
    ret = 0
    while val > 0 : 
        ret += val % 10
        val = val // 10
    return True if ret <= s else False

def solve():
    # code goes here!!         
    t = int(input())
    for test in range(t):
        n,s = map(int,input().split())
        pw = 1
        ans = 0
        for i in range(0,18):
            if ok(n,s) == True:
                break
            digit = (n // pw) % 10
            adds = pw * ((10 - digit) % 10)
            n += adds
            ans += adds
            pw *= 10
        print(ans)

def main():
    if Path('test.inp').exists():
        sys.stdin = open("test.inp","r")
    solve()

if __name__ == '__main__':
    main()