#include <bits/stdc++.h>
using namespace std;
const int S = int(2e5) + 100;
const int INF = int(1e9) + 7;
const long long MOD = long long(1e9) + 7;
const double PI = 3.141592653589793238;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
void print(T& v) {
  for (auto& x : v) cout << x << " ";
  cout << endl;
}
long long ans(long long n, int k) {
  vector<int> dg;
  long long on = n;
  while (n) {
    dg.emplace_back(n % 10);
    n /= 10;
  }
  reverse(dg.begin(), dg.end());
  int i = 0, seen[10] = {}, cnt = 0;
  for (; i < (int)(dg).size(); i++) {
    if (!seen[dg[i]]) {
      cnt++;
      seen[dg[i]] = 1;
    }
    if (cnt > k) break;
  }
  if (cnt <= k) return on;
  long long m = 0;
  for (int j = 0; j <= i; j++) m = m * 10 + dg[j];
  m++;
  for (int j = (0); j < ((int)(dg).size() - i - 1); ++j) m *= 10;
  return ans(m, k);
}
int t, k;
long long n;
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin >> t;
  while (t--) {
    cin >> n >> k;
    cout << ans(n, k) << endl;
  }
  return 0;
}
