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;
int32_t main() {
  unsigned long long t = 1;
  cin >> t;
  while (t--) {
    unsigned long long n, s;
    cin >> n >> s;
    unsigned long long sum = 0;
    {
      unsigned long long x = n;
      while (x) {
        sum += x % 10;
        x /= 10;
      }
    }
    if (sum <= s) {
      cout << 0 << "\n";
      continue;
    }
    unsigned long long x = 10, res = 0;
    while (sum > s) {
      res += (x - (n % x));
      n += (x - (n % x));
      sum = 0;
      unsigned long long y = n;
      while (y) {
        sum += y % 10;
        y /= 10;
      }
      x *= 10;
    }
    cout << res << "\n";
  }
  return 0;
}