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: # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
  import sys
  def main(N, K):
      S = str(N)
      d = len(S)
  
      if d <= K:
          return N
      if len(set(S)) <= K:
          return N
  
      for i in range(d - 1, -1, -1):
          up = set(S[:i])
          if len(up) > K:
              continue
          if len(up) == K:
              n = int(S[i])
              for m in sorted(up):
                  if int(m) > n: break
              else: continue
              res = S[:i] + m
              mn = min(up)
              for _ in range(i + 1, d):
                  res += mn
              return int(res)
          n = int(S[i])
          if n == 9: continue
          m = str(n + 1)
          res = S[:i] + m
          up.add(m)
          if len(up) == K:
              mn = min(up)
              for _ in range(i + 1, d):
                  res += mn
              return int(res)
          for _ in range(i + 1, d):
              res += '0'
          return int(res)
  
  if __name__ == '__main__':
      input = sys.stdin.readline
      T = int(input())
      for _ in range(T):
          N, K = map(int, input().split())
          print(main(N, K))
  