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 long long maxn = 2e5 + 5;
int main() {
  long long t;
  cin >> t;
  while (t--) {
    string s1;
    long long n;
    cin >> s1 >> n;
    int sum = 0;
    long long ans = 0;
    int len = s1.size();
    for (int i = 0; i < len; i++) {
      sum += s1[i] - '0';
      if (n > sum) {
        n = n;
      } else if (n == sum) {
        int f = 0;
        for (int j = i + 1; j < len; j++) {
          if (s1[j] != '0') f = 1;
        }
        if (f == 0)
          break;
        else {
          ans = ans * 10 + s1[i] - '0';
          n--;
        }
      } else {
        ans = ans * 10 + s1[i] - '0';
      }
    }
    long long k = ans;
    long long xx = 1;
    int g = 0;
    if (k == 0) xx = 0;
    while (k) {
      g++;
      k = k / 10;
    }
    for (int i = 0; i < g; i++) xx = xx * 10;
    cout << xx - ans << "\n";
  }
  return 0;
}