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;
inline long long POW(long long n, long long m) {
  long long ans = 1;
  for (long long i = 1; i <= m; i++) {
    ans *= n;
  }
  return ans;
}
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long m;
    string s;
    cin >> s >> m;
    long long k = 0;
    long long sum = 0, sum1 = 0;
    for (long long i = 0; i < s.length(); i++) {
      sum1 = sum1 + s[i] - '0';
    }
    for (long long i = 0; i < s.length(); i++) {
      sum = sum + s[i] - '0';
      if (sum >= m) {
        k = i;
        break;
      }
    }
    if (sum1 <= m) {
      cout << "0" << endl;
      continue;
    }
    if (s.length() == 1) {
      cout << 10 - (s[0] - '0') << endl;
      ;
    } else {
      string w = "";
      for (int i = k; i < s.length(); i++) {
        w = w + s[i];
      }
      long long q = stoll(w);
      long long x;
      x = 1 * POW(10, s.length() - k) - q;
      cout << x << endl;
    }
  }
  return 0;
}