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;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch <= '9' && ch >= '0') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
const int maxn = 100 + 10;
const int mod = 1e6 + 7;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n;
    int s;
    cin >> n >> s;
    string str = to_string(n);
    int len = str.length();
    int cnt = 0;
    for (int i = 0; i < len; i++) {
      cnt += str[i] - '0';
    }
    if (cnt <= s) {
      cout << 0 << endl;
      continue;
    }
    cnt = 0;
    if (str[0] - '0' >= s) {
      int mark = -1;
      for (int k = len - 1; k > 0; k--) {
        if (str[k] - '0' != 0) {
          mark = k;
          break;
        }
      }
      if (mark == -1) {
        cout << 10 - (str[0] - '0');
        for (int k = 1; k < len; k++) cout << 0;
        cout << endl;
        continue;
      } else {
        int first = 1;
        for (int k = 0; k < len; k++) {
          if (k < mark) {
            if (first && str[k] == '9')
              continue;
            else {
              cout << 9 - (str[k] - '0');
              first = 0;
            }
          } else if (k == mark)
            cout << 10 - (str[k] - '0');
          else if (k > mark)
            cout << 0;
        }
        cout << endl;
        continue;
      }
    } else {
      for (int i = 0; i < len; i++) {
        cnt += str[i] - '0';
        if (cnt >= s) {
          int mark = -1;
          for (int k = len - 1; k > i; k--) {
            if (str[k] != '0') {
              mark = k;
              break;
            }
          }
          if (mark == -1) {
            cout << 10 - (str[i] - '0');
            for (int k = i + 1; k < len; k++) cout << 0;
            cout << endl;
            break;
          } else {
            int first = 1;
            for (int k = i; k < len; k++) {
              if (k < mark) {
                if (first && str[k] == '9')
                  continue;
                else {
                  cout << 9 - (str[k] - '0');
                  first = 0;
                }
              } else if (k == mark)
                cout << 10 - (str[k] - '0');
              else if (k > mark)
                cout << 0;
            }
            cout << endl;
            break;
          }
        }
      }
    }
  }
  return 0;
}