#include <bits/stdc++.h>
using namespace std;
#define debug(fmt, ...) \
  fprintf(stderr, "[%d] " fmt "\n", __LINE__, ##__VA_ARGS__)
template <class _Tx, class _Ty>
inline void chkmin(_Tx& x, const _Ty& y) { if (y < x) x = y; }
template <class _Tx, class _Ty>
inline void chkmax(_Tx& x, const _Ty& y) { if (x < y) x = y; }
bool Mbe;
using ll = long long;
constexpr int N = 40;
int k, a[N];
string str;
__int128_t dp[N][N][2][2];
ostream& operator<<(ostream& out, const __int128_t& x) {
  if (x < (ll)1e18) return out << (ll)x;
  return out << (ll)(x / (ll)1e18)
             << setw(18) << setfill('0') << (ll)(x % (ll)1e18);
}
void mian() {
  cin >> str >> k;
  memset(a, 0, sizeof(a));
  for (int i = 0; i < (int)str.size(); ++i)
    a[i] = str[str.size() - i - 1] - '0';
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j <= k; ++j) {
      dp[i][j][0][0] = dp[i][j][0][1] = dp[i][j][1][0] = dp[i][j][1][1] = 2e36;
    }
  }
  dp[N - 1][0][0][0] = 0;
  for (int i = N - 2; ~i; --i) {
    for (int j = 0; j <= k; ++j) {
      for (int d = 0; d < 10; ++d) {
        for (int x = 0; x < 2; ++x) {
          for (int y = 0; y < 2; ++y) {
            bool t = a[i] + d + x > 9;
            if (j >= t) chkmin(dp[i][j][x][y || d], dp[i + 1][j - t][t][y] * 10 + d);
          }
        }
      }
    }
  }
  cout << dp[0][k][0][1] << '\n';
}
bool Med;
int main() {
  // debug("Mem: %.4lfMB.", fabs(&Med - &Mbe) / 1048576);
  cin.tie(0)->sync_with_stdio(0);
  int cas;
  cin >> cas;
  while (cas--) mian();
  return 0;
}
/*
g++ -std=c++14 -O2 -o C C.cpp -Wall -Wextra -Wshadow
-fsanitize=address,undefined -g
*/