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 = map(int, input().split())
    sum_of_digit=0
    m=n
    digit_cnt=0
    while(m):
        sum_of_digit+=(m%10)
        digit_cnt+=1
        m//=10
    if (sum_of_digit <= s):
        print(0)
        continue
    m=n
    digit_cnt2=0
    flag=0
    while(m):
        sum_of_digit -= (m%10)
        m//=10
        digit_cnt2+=1
        if (m and sum_of_digit <= (s-1)):
            m+=1
            while(digit_cnt2):
                digit_cnt2-=1
                m*=10
            print(m-n)
            flag=1
            break
    if flag:
        continue
    m=1
    while(digit_cnt):
        digit_cnt-=1
        m*=10
    print(m-n)