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;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T, tt;
  cin >> T;
  for (tt = 0; tt <= T - 1; tt++) {
    int s, i = 0, sum = 0, no_digits = 0;
    int j;
    long long int n, tmp;
    cin >> n >> s;
    tmp = n;
    int a[18];
    while (tmp != 0) {
      a[i] = tmp % 10;
      i++;
      tmp = tmp / 10;
    }
    no_digits = i;
    for (i = no_digits - 1; i >= 0; i--) {
      sum += a[i];
    }
    if (sum <= s) {
      cout << "0" << endl;
    } else {
      int p = 0;
      for (i = no_digits - 1; i >= 0; i--) {
        p += a[i];
        if (p >= s) {
          break;
        }
      }
      long long int num = 0, jmp = 1;
      for (j = 0; j <= i; j++) {
        num += (jmp)*a[j];
        jmp *= 10;
      }
      cout << jmp - num << endl;
    }
  }
  return 0;
}