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:
for _ in range (int (input())):
    n,s = input().split()
    s = int(s)

    digits= [int(c) for c in n]
    x = len(digits)
    p =0
    while digits[x-1]==0:
        x -=1
        p +=1
    ## p is the power such that n = m *10^p and m%10!=0  
    y,s_ = 0, 0
    while s_ < s and y <x:
        s_ += digits[y]
        y  +=1

    if y==x and s_ <= s: ## the sum of digits is <=s
        print (0)
    else: 
        suffix = int(n[y-1:x])
        ans = (10**(x-y+1)-suffix)*(10**p)
        print (ans)