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 java.util.*;
  import java.io.*;
  import java.lang.*;
  
  
  
  
  public class cc {
  	
  	private class Pair{
  		ArrayList<String> a = new ArrayList<>();
  		
  	}
  	
  	static class FastReader {
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader()
          {
              br = new BufferedReader(
                  new InputStreamReader(System.in));
          }
   
          String next()
          {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
   
          int nextInt() { return Integer.parseInt(next()); }
   
          long nextLong() { return Long.parseLong(next()); }
   
          double nextDouble()
          {
              return Double.parseDouble(next());
          }
   
          String nextLine()
          {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  	
  	private static FastReader sc =new FastReader();
  	
  	public static void main(String[] args) {
  		int t = sc.nextInt();
  		while(t-->0) {
  			solve();
  		}
  
  	}
  
  	private static void solve() {
  		char n[] = (sc.next()).toCharArray();
  		int k = sc.nextInt();
  		while(true) {
  //			System.out.println(k+" "+new String(n));
  			Set<Character> s = new HashSet<>();
  			for(int i=0; i<n.length; i++) {
  				s.add(n[i]);
  			}
  			if(s.size()<=k) {
  				System.out.println(n);
  				return;
  			}
  			s = new HashSet<>();
  			for(int ptr = 0; ptr<n.length; ptr++){
  				s.add(n[ptr]);
  //				System.out.println(s.size());
  				if(s.size() > k) {
  					while(n[ptr]=='9') {
  						ptr--;
  					}
  					n[ptr]++;
  					for(int j=ptr+1; j<n.length; j++) {
  						n[j] = '0';
  					}
  					break;
  				}
  			}
  		}
  	}
  }
  