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:
/**
 * Accomplished using the EduTools plugin by JetBrains https://plugins.jetbrains.com/plugin/10081-edutools
 */

import java.io.*;

public class Main {
   public static void main(String[] args) throws IOException {
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

      int t = Integer.parseInt(br.readLine());

      while (t-- > 0) {
         String[] line = br.readLine().split(" ");
         char[] n = line[0].toCharArray();
         int s = Integer.parseInt(line[1]);
         int sum = 0;
         long res = 0;

         for (int i = 0; i < n.length; ++i) {
            sum += (n[i] -= '0');
         }

         long digit = 1;
         for (int i = n.length - 1; sum > s && i >= 0; --i, digit *= 10) {
             if (n[i] > 0) {
                res += digit * (10 - n[i]);
                sum -= n[i] - 1;
                if (i > 0) {
                   ++n[i - 1];
                }
             }
         }

         bw.write(Long.toString(res));
         bw.newLine();
      }

      br.close();
      bw.close();
   }
}