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.math.BigInteger;
import java.util.Scanner;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    int t = sc.nextInt();
    for (int tc = 0; tc < t; ++tc) {
      long n = sc.nextLong();
      int s = sc.nextInt();

      System.out.println(solve(n, s));
    }

    sc.close();
  }

  static BigInteger solve(long n, int s) {
    BigInteger placeValue = BigInteger.ONE;
    BigInteger current = BigInteger.valueOf(n);
    while (computeDigitSum(current) > s) {
      current = current.divide(placeValue).multiply(placeValue).add(placeValue);
      placeValue = placeValue.multiply(BigInteger.TEN);
    }

    return current.subtract(BigInteger.valueOf(n));
  }

  static int computeDigitSum(BigInteger x) {
    return x.toString().chars().map(ch -> ch - '0').sum();
  }
}