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, sys
  from io import BytesIO, IOBase
  from math import log2, ceil, sqrt, gcd
  from _collections import deque
  import heapq as hp
  from bisect import bisect_left, bisect_right
  from math import cos, sin
  
  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")
  
  
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  
  mod = 10 ** 9 + 7
  
  
  for _ in range(int(input())):
      n,k=map(int,input().split())
      d=dict()
      a=[int(i) for i in str(n)]
  
      for i in range(len(a)):
          if a[i] not in d:
              if len(d)==k:
                  break
          d[a[i]]=d.get(a[i],0)+1
      if i==len(a)-1 and a[i] in d:
          print(n)
          continue
      # print(d)
      ans=float('inf')
      while i>=0:
          if a[i] in d:
              d[a[i]]-=1
              if d[a[i]]==0:
                  d.__delitem__(a[i])
          # print(a[i], d, len(d), k)
          if len(d)==k:
              # print(1)
              if a[i]+1 in d:
                  x=a[:i]+[a[i]+1]
                  t=min(d)
                  for _ in range(len(x),len(a)):
                      x.append(t)
                  x=int(''.join(map(str,x)))
                  if x>=n:
                      ans=min(ans,x)
              else:
                  t=float('inf')
                  for k1 in sorted(d):
                      if k1>a[i]:
                          t=min(t,k1)
                  if t!=float('inf'):
                      x = a[:i] + [t]
                      t = min(d)
                      for _ in range(len(x), len(a)):
                          x.append(t)
                      x = int(''.join(map(str, x)))
                      if x >= n:
                          ans = min(ans, x)
  
          elif len(d)==k-1:
              # print(2)
              if a[i]+1 in d:
                  x=a[:i]+[a[i]+1]
                  t=0
                  for _ in range(len(x),len(a)):
                      x.append(t)
                  x=int(''.join(map(str,x)))
                  if x>=n:
                      ans=min(ans,x)
              else:
                  x = a[:i] + [a[i] + 1]
                  if d:
                      t = min(d)
                  else:
                      t=a[i]+1
                  t=min(t,a[i]+1)
                  for _ in range(len(x), len(a)):
                      x.append(t)
                  x = int(''.join(map(str, x)))
                  if x >= n:
                      ans = min(ans, x)
          else:
              # print(3)
              x = a[:i] + [a[i] + 1]
              t = 0
              for _ in range(len(x), len(a)):
                  x.append(t)
              x = int(''.join(map(str, x)))
              if x >= n:
                  ans = min(ans, x)
          # print(ans)
  
          i-=1
      print(ans)
  
  