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:
#This code is contributed by Siddharth
import time
import heapq
import sys
from collections import *
from heapq import *
import math
import bisect
from itertools import *
mod=10**9+7








for _ in range(int(input())):
    n,s=map(int,input().split())
    string=str(n)
    summ=0
    for i in string:
        summ+=int(i)
    if summ<=s:
        print(0)
        continue
    i=0
    summ=0
    while i<len(string) and summ+int(string[i])<s:
        summ+=int(string[i])
        i+=1

    diff=len(string)-i

    num=n%(pow(10,diff))
    print(pow(10,diff)-num)