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;
long long sum(long long n) {
  long long sum = 0;
  while (n > 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
int main() {
  int test;
  cin >> test;
  while (test--) {
    long long n;
    int s;
    cin >> n >> s;
    long long ans = 0ll;
    if (sum(n) <= s) {
      cout << 0 << endl;
      continue;
    }
    long long power = 1ll;
    for (int i = 0; i < 18; i++) {
      int digit = (n / power) % 10;
      long long add = power * ((10 - digit) % 10);
      n += add;
      ans += add;
      if (sum(n) <= s) break;
      power *= 10;
    }
    cout << ans << endl;
  }
  return 0;
}