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;
const int mod = 1e9 + 7;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long int t;
  cin >> t;
  while (t--) {
    string str;
    long long int x;
    cin >> str >> x;
    long long int n = str.length(), sum = 0, idx, flag = true;
    for (long long int i = 0; i < n; i++) {
      sum += str[i] - '0';
      if (sum >= x and flag) idx = i, flag = false;
    }
    if (sum <= x)
      cout << 0;
    else {
      long long int y = 0, z = 1;
      for (long long int j = idx; j < n; j++)
        y = y * 10 + (str[j] - '0'), z *= 10;
      cout << z - y;
    }
    cout << "\n";
  }
  return 0;
}