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

Solution:
#include <bits/stdc++.h>
using namespace std;
int main(void) {
  long long int t;
  cin >> t;
  for (long long int i = 0; i < t; i++) {
    long long int n, s;
    cin >> n >> s;
    long long int x = 0;
    long long int q = n;
    while (1) {
      long long int a = 0;
      long long int f = q;
      while (f != 0) {
        a = a + f % 10;
        f /= 10;
      }
      if (a <= s) {
        cout << x << endl;
        break;
      } else {
        for (long long int j = 1;;) {
          long long int z = pow(10, j);
          if (q % (z) != 0) {
            q = (q / (z) + 1) * (z);
            x = q - n;
            break;
          } else
            j++;
        }
      }
    }
  }
}