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,x = map(int,input().split())
    s = list(str(n))
    c = 0
    ss = len(s)
    for i in s:
        c+=int(i)
    if c<=x:
        print(0)
    else:
        for i in range(len(s)-1,0,-1):
            if s[i] == "0":
                continue
            if c<=x:
                break
            else:
                if s[i-1] == "9":
                    for j in range(i-1,-1,-1):
                        if s[j] == "9" and j!=0:
                            c-=9
                            s[j] = "0"
                        else:
                            if j == 0 and s[j] == "9":
                                c-=8
                                s[j] = str(int(s[j]) + 1)
                            else:
                                c+=1
                                s[j] = str(int(s[j]) + 1)
                                break
                    c-=(int(s[i]))
                    s[i] = "0"
                else:
                    c-=(int(s[i]))
                    c+=1
                    s[i] = "0"
                    s[i-1] = str(int(s[i-1]) + 1)
        if c>x:
            s[0] = "1"
            s.append("0")
            xx = "".join(s)
            xx = int(xx)
            print(xx-n)
        else:
            xx = "".join(s)
            xx = int(xx)
            print(xx-n)