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())
    if(s>=n):
        print(0)
        continue
    stringno=str(n)
    temp_sum=0
    cnt=0
    for q in stringno:
        temp_sum+=int(q)
        if(temp_sum>=s):
            break
        cnt+=1
    ord_sum=0
    for q in stringno:
        ord_sum+=int(q)
    if(ord_sum<=s):
        print(0)
        continue
    elif(ord_sum==temp_sum and temp_sum==s):
        print(0)
        continue
    if(cnt==0):
        temp=10**len(stringno)
        #print(temp)
        print(temp-n)
    else:
        temp=int(stringno[cnt])
        
        #print(temp)
        temp=10-temp
        temp=int(stringno[:cnt+1])+temp
        temp=temp*(10**(len(stringno)-cnt-1))
        #print(temp)
        print(temp-n)