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.*;
import java.io.*;

/**
 * Made by egor https://github.com/chermehdi/egor.
 * 
 * @author Azuz
 * 
 */
public class Main {

    void solve(Scanner in, PrintWriter out) {
      int t = in.nextInt();
      while (t-->0) {
        long n = in.nextLong();
        long s = in.nextLong();
        long c = count(n);

        long ans = 0;
        long cur = 1;
        while (c > s) {
          cur *= 10;
          long cc = n % cur;
          if (cc == 0) continue;
          ans += cur - cc;
          n += cur - cc;
          c = count(n);;
        }

        out.println(ans);
      }
    }

    long count(long n) {
      long ret = 0;
      while (n > 0) {
        ret += n % 10;
        n /= 10;
      }
      return ret;
    }
    public static void main(String[] args) {
        try(Scanner in = new Scanner(System.in);
            PrintWriter out = new PrintWriter(System.out)) {
            new Main().solve(in, out);
        }
    }
}