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 io,os
  input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
  
  def findnext(c,dic):
      for d in range(int(c)+1,10):
          if str(d) in dic:  return str(d)
  
  
  def nextdigit(c):
      return str(int(c)+1)
  
  def main(t):
  
  
      n,k = map(int,input().split())
      s = list(str(n))
      m = len(s)
      dic = {}
      for c in s:  
          if c not in dic: dic[c] = 0
          dic[c] += 1
  
      if len(dic)<=k:  
          print("".join(s))
          return 
  
     
      while len(dic)>k:
  #        print(s,dic) 
          dic[s[-1]] -= 1
          if dic[s[-1]] == 0:  del dic[s[-1]]
  
          while s[-1]=='9': 
              s.pop()
              dic[s[-1]] -= 1
              if dic[s[-1]]==0:  del dic[s[-1]]
  
           
          s[-1] = str(int(s[-1])+1)
          if s[-1] not in dic:  dic[s[-1]] = 0
          dic[s[-1]] += 1
  
      if len(dic)<k:  ans = "".join(s) + "0"*(m-len(s))
      else:  ans = "".join(s) + min(dic)*(m-len(s))
  
  
      print(ans) 
  
  
  
  
  
  
  
  
      
      
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  T = int(input())
  t = 1
  while t<=T:
      main(t)
      t += 1
  