description: It is a complicated version of problem F1. The difference between them is the constraints (F1: k ≤ 2, F2: k ≤ 10).
  
  You are given an integer n. Find the minimum integer x such that x ≥ n and the number x is k-beautiful.
  
  A number is called k-beautiful if its decimal representation having no leading zeroes contains no more than k different digits. E.g. if k = 2, the numbers 3434443, 55550, 777 and 21 are k-beautiful whereas the numbers 120, 445435 and 998244353 are not.
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
  
  Each test case consists of one line containing two integers n and k (1 ≤ n ≤ 10^9, 1 ≤ k ≤ 10).
  
  Output
  
  For each test case output on a separate line x — the minimum k-beautiful integer such that x ≥ n.
  
  Example
  
  Input
  
  
  6
  2021 3
  177890 2
  34512 3
  724533 4
  998244353 1
  12345678 10
  
  
  Output
  
  
  2021
  181111
  34533
  724542
  999999999
  12345678
solution: import os
  import sys
  from io import BytesIO, IOBase
   
  BUFSIZE = 8192
   
   
  class FastIO(IOBase):
      newlines = 0
   
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
   
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
   
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
   
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
                        
              
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
          
  class RangeQuery:
      def __init__(self, data, func=min):
          self.func = func
          self._data = _data = [list(data)]
          i, n = 1, len(_data[0])
          while 2 * i <= n:
              prev = _data[-1]
              _data.append([func(prev[j], prev[j + i]) for j in range(n - 2 * i + 1)])
              i <<= 1
   
      def query(self, start, stop):
          """func of data[start, stop)"""
          depth = (stop - start).bit_length() - 1
          return self.func(self._data[depth][start], self._data[depth][stop - (1 << depth)])
   
      def __getitem__(self, idx):
          return self._data[0][idx]
   
   
  def check(st, n, k):
      for i in range(n-k+1):
          g = st.query(i, i+k)
          if(g > 1):
              return True 
      return False
   
   
   
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  from collections import defaultdict,deque
  from math import ceil,floor,sqrt,log2,gcd,pi
  from heapq import heappush,heappop
  from fractions import Fraction
  from bisect import bisect_left,bisect,bisect_right
  from itertools import combinations_with_replacement,permutations
  import sys
  abc='abcdefghijklmnopqrstuvwxyz'
  ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ"
  
  for _ in range(int(input())):
      n,k=map(int,input().split())
      arr=[int(i) for i in str(n)]
      s=set()
      l=len(arr)
      pre=0
      for _ in range(1000):
          pre=0
          # print(n)
          arr=[int(i) for i in str(n)]
          s=set()
          l=len(arr)
          le=0
          for i in arr:
              if i in s:
                  le+=1
                  pre=pre*10+i
              elif len(s)<k:
                  s.add(i)
                  le+=1
                  pre=pre*10+i
              else:
                  pre=pre*10+i
                  pre+=1
                  # print(pre)
                  lp=len(str(pre))
                  pre=pre*(10**(l-lp))
                  n=pre
                  break
          if le==l:
              print(pre)
              break