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 d_sum(long long n) {
  long long res = 0;
  while (n) {
    res += n % 10;
    n /= 10;
  }
  return res;
}
void solve() {
  long long n, s;
  cin >> n >> s;
  long long old = n;
  long long sum = d_sum(n);
  if (sum <= s) {
    cout << "0\n";
    return;
  }
  long long cur = 1;
  while (sum > s) {
    cur *= 10;
    n /= 10;
    n++;
    sum = d_sum(n);
  }
  cout << n * cur - old << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long t;
  cin >> t;
  while (t--) solve();
}