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 math

for _ in range(int(input())):
    n,s = map(int,input().split())
    summ = 0
    str_n = str(n)
    for i in str_n:
        summ += int(i)
    d = summ-s
    if d<=0: print(0)
    else:
        ans = ""
        m = len(str_n)
        i = m-1
        while i>=0 and str_n[i]=="0":
            i-=1
            ans += "0"
        ans += str(10-int(str_n[i]))
        d -= (int(str_n[i])-1)
        i-=1
        if d<=0: 
            ans = ans[::-1]
            print(int(ans))
        else:
            for j in range(i,-1,-1):
                # print(d)
                x = int(str_n[j])
                d -= x
                ans += str(10-(x+1))
                if d<=0: break
            ans = ans[::-1]
            print(int(ans))