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:
def modify(l,p):
    s=list(l)
    for i in range(p,len(s)):
        s[i]='0'
    p-=1
    ok=1
    while p>=0:
        if s[p]=='9' and ok==1:
            s[p]='0'
        else:
            if ok==1:
                s[p]=chr(ord(s[p])+1)
            else:
                s[p]=s[p]
            ok=0
        p-=1
    if s[0]=='0':return '1'+(''.join(s))
    return ''.join(s)

def tc():
    sn,ss=[x for x in input().split(' ')]
    n=int(sn)
    s=int(ss)
    suf=[0]*len(sn)
    j=len(sn)-2
    while j>=0:
        suf[j]=max(suf[j+1],ord(sn[j+1])-ord('0'))
        j-=1
    cur=0
    for i in range(len(sn)):
        cur+=ord(sn[i])-ord('0')
        if cur+1>s and suf[i]>0:
            sn=modify(sn,i)
            break
        if cur>s:
            sn=modify(sn,i)
            break
    # print(sn)
    print(int(sn)-n)

t=int(input());
for _ in range(t):
    tc()