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>
const int inf = 1e9;
const int dx[] = {0, 1, -1, 0};
const int dy[] = {-1, 0, 0, 1};
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, cas = 1;
  cin >> t;
  while (t--) {
    long long x, y;
    cin >> x >> y;
    if (x % y == 0)
      cout << "0" << endl;
    else if (x >= y) {
      long long z = x / y;
      long long n = y * (z + 1);
      cout << n - x << endl;
    } else
      cout << y - x << endl;
  }
}