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:
'''
    Rohit Kumar Vishwas
    13th June 2021
'''

import sys
import math
import os.path
from collections import *
from queue import *
from bisect import *
from heapq import *
# sys.setrecursionlimit(10 ** 6)
MOD = int(1e9 + 7)
inf = float('inf')
ninf = float('-inf')

# if(os.path.exists('inp.txt')):
#     sys.stdin = open("inp.txt", "r")
#     sys.stdout = open("out.txt", "w")
input = sys.stdin.buffer.readline
def ii(): return list(map(int, input().strip().split()))


for _ in range(int(input())):
    n, s = ii()
    dif = sum(map(int, str(n))) - s
    if dif <= 0:
        print(0)
        continue
    # print(dif)
    k, sm, n1 = 0, 0, n
    while sm - 1 < dif:
        sm += n % 10
        n = n // 10
        k += 1
    k = 10 ** k
    print(k - n1 % k)