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 numpy as np
# input = sys.stdin.readline

# def inp():
#     return(int(input()))
# def inlt():
#     return(list(map(int,input().split())))
# def insr():
#     s = input()
#     return(list(s[:len(s) - 1]))
# def invr():
#     return(map(int,input().split()))

x= int(input())
# a=np.zeros((x,2))
rows, cols = (x, 2)
a = [[0]*cols]*rows
b=[]
# print(a)
for i in range(0,x):
    a[i][0],a[i][1] = map(int, input().split())
    if (a[i][1] > a[i][0]):
        b.append((int(a[i][1]-a[i][0])))
    else:
        if (a[i][0]% a[i][1])==0:
            b.append(0)
        else:b.append((int(a[i][1]-(a[i][0]% a[i][1]))))
    # print(a[i][0])
for i in range(0,x):
    print(b[i])


# for i in range(0,x):
#     if(a[i][1]>a[i][0]):
#         print(int(a[i][1]-a[i][0]))
#     else:
#         if (a[i][0]% a[i][1])==0:
#             print(0)
#         else:print(int(a[i][1]-(a[i][0]% a[i][1])))