#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


constexpr int N = 40;

int L, K;
char S[N + 1];

int ansLen;
char ans[N + 1];

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%s%d", S, &K);
    L = strlen(S);
    
    if (K == 0) {
      ansLen = 0;
      ans[ansLen++] = '1';
      for (int i = L; --i >= 0 && S[i] == '9'; ) {
        ans[ansLen++] = '0';
      }
    } else {
      Int dp[N + 1][2] = {};
      dp[0][0] = 1 << 0;
      for (int i = 0; i < N; ++i) {
        const int s = (i < L) ? (S[L - 1 - i] - '0') : 0;
        dp[i + 1][0] = (s == 9) ? dp[i][0] : (dp[i][0] | dp[i][1]);
        dp[i + 1][1] = (s == 0) ? dp[i][1] : (dp[i][0] | dp[i][1]);
        dp[i + 1][1] <<= 1;
      }
      assert(dp[N][0] >> K & 1);
      for (int i = N, c = 0, k = K; --i >= 0; ) {
        k -= c;
        const int s = (i < L) ? (S[L - 1 - i] - '0') : 0;
        if (c == 0) {
          if (dp[i][0] >> k & 1) {
            ans[i] = '0';
            c = 0;
          } else if (s != 9 && (dp[i][1] >> k & 1)) {
            ans[i] = '0';
            c = 1;
          } else {
            assert(false);
          }
        } else {
          if (dp[i][1] >> k & 1) {
            ans[i] = '0' + (9 - s);
            c = 1;
          } else if (s != 0 && (dp[i][0] >> k & 1)) {
            ans[i] = '0' + (10 - s);
            c = 0;
          } else {
            assert(false);
          }
        }
      }
      for (int i = N; --i >= 0; ) {
        if (ans[i] != '0') {
          ansLen = i + 1;
          reverse(ans, ans + (i + 1));
          break;
        }
      }
    }
    
    ans[ansLen] = 0;
    puts(ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}