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>
unsigned long long digit(unsigned long long k) {
  unsigned long long cnt = 0;
  while (k) cnt += k % 10, k /= 10;
  return cnt;
}
unsigned long long work(unsigned long long n, unsigned long long s) {
  if (digit(n) <= s) return 0;
  unsigned long long k = 1, cnt = 0, t = n, ans = 0x7fffffffffffffff;
  while (t) cnt++, t /= 10;
  for (unsigned long long i = 1; i <= cnt; i++) {
    k *= 10;
    if (digit(k - n % k + n) <= s) ans = std::min(ans, k - n % k);
  }
  return ans;
}
int main() {
  int t = 0;
  scanf("%d", &t);
  while (t--) {
    unsigned long long n, s;
    std::cin >> n >> s;
    std::cout << work(n, s) << "\n";
  }
}