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 JAVA):

Solution:
import java.util.Scanner;

/**
 * @author htdong
 * @date 2018年4月20日 上午11:52:19
 */

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int _t = in.nextInt();
        while (_t-- > 0) {
            long n = in.nextLong();
            int s = in.nextInt();
            int num = 0;
            long ans = 0;
            long m = n;
            while (m > 0) {
                num += m % 10;
                m /= 10;
            }
            long x = 1;
            while (num > s) {
                x *= 10;
                long z = n % x;
                if (z == 0) {
                    continue;
                }
                ans += x - z;
                n += x - z;
                num = 0;
                m = n;
                while (m > 0) {
                    num += m % 10;
                    m /= 10;
                }
            }
            System.out.println(ans);
        }
        in.close();
    }
}