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 t, n, s, ans;
int sum(long long x) {
  int tong = 0;
  while (x > 0) {
    tong += x % 10;
    x = x / 10;
  }
  return tong;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    cin >> n >> s;
    ans = n;
    if (sum(n) <= s) {
      cout << 0 << endl;
      continue;
    }
    long long Pow = 10;
    for (int i = 1; i <= 19; i++) {
      long long luu = n % Pow;
      long long x = Pow - luu;
      n = n + x;
      if (sum(n) <= s) {
        break;
      }
      Pow = Pow * 10;
    }
    cout << n - ans << endl;
  }
}