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;
const long long NN = 2e5 + 5;
long long t, n, s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    cin >> n >> s;
    string z = to_string(n);
    long long l = z.length();
    long long hz = 0;
    long long lst = -1;
    long long hzz = 0;
    for (long long i = 0; i < l; i++) {
      hz += (z[i] - '0');
      if (z[i] == '9') continue;
      if (hz < s) {
        lst = i;
      }
    }
    if (hz <= s) {
    } else if (lst == -1) {
      z = "1";
      for (long long i = 0; i < l; i++) z += "0";
    } else if (lst < l) {
      z[lst]++;
      for (long long i = lst + 1; i < l; i++) z[i] = '0';
    }
    cout << stoll(z) - n << "\n";
  }
}