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 read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return f * x;
}
long long ans;
int mts[20];
int main() {
  int t = read();
  while (t--) {
    long long a = read(), as = 0, i;
    int s = read();
    int nw = 0;
    for (i = 1;; ++i) {
      if (!a) break;
      nw += mts[i] = a % 10;
      a /= 10;
    }
    i = 1;
    int pos = 1;
    while (nw > s) {
      nw -= mts[pos];
      nw++;
      as += i * (10 - mts[pos]);
      pos++;
      mts[pos]++;
      i *= 10;
    }
    cout << as << '\n';
  }
  return 0;
}