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:
t = int(input())
for _ in range(t):
    lst = input().split()
    s = int(lst[1])
    n = int(lst[0])
    st = lst[0]
    sum1 = 0
    pos = -1
    sum2=0
    for i in st:
        sum2 += int(i)
    if sum2<=s:
        print(0)
        continue;
    for i in range(len(st)):
        sum1 += int(st[i])
        if sum1 >= s:
            pos = i
            break
    if pos == -1:
        print(0)
        continue
    str2 = ""
    str2 = st[0:pos]
    str2 =str2 + '0'*(len(st)-pos)
    if pos == 0:
        str2 = '1'+str2
    else:
            if str2[pos-1]=='9':
                str3 = '1'
                str3 = str3 + '0'*(len(st)-pos)
                str2 = int(str2)+int(str3)
            else:
                temp = str(int(st[pos-1])+1)
                str2 = str2[0:pos-1]+temp+str2[pos:]
    print(int(str2)-n)