description: It is a simplified version of problem F2. 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 ≤ 2).
  
  Output
  
  For each test case output on a separate line x — the minimum k-beautiful integer such that x ≥ n.
  
  Example
  
  Input
  
  
  4
  1 1
  221 2
  177890 2
  998244353 1
  
  
  Output
  
  
  1
  221
  181111
  999999999
solution: import java.io.*;
  import java.util.*;
   
  public class F1 {
  	static Kattio io;
  	static TreeSet<Long> set1;
  	static TreeSet<Long> set;
  	public static void main (String[] args) throws IOException {
  		set1 = new TreeSet<Long>();
  		set = new TreeSet<Long>();
  
  		for (int i=0; i<=9; i++) {
  			for (int j=i; j<=9; j++) {
  				for (int digits=1; digits<=10; digits++) {
  					for (int bin=0; bin<Math.pow(2, digits); bin++) {
  						StringBuilder sb = new StringBuilder();
  
  						for (int b=0; b<digits; b++) {
  							if ((bin & (long) Math.pow(2, b)) == 0) {
  								sb.append(i);
  							} else {
  								sb.append(j);
  							}
  						}
  
  						long val = Long.valueOf(sb.toString());
  						set.add(val);
  						if (i==j) set1.add(val);
  					}
  				}
  			}
  		}
  
  		io = new Kattio();
  		int t = io.nextInt();
  		for (int ii=0; ii<t; ii++) {
  			solve();
  		}
  	}
  
  	static void solve() {
  		long n = io.nextLong();
  		int k = io.nextInt();
  		
  		if (k==1) {
  			System.out.println(set1.ceiling(n));
  		} else {
  			System.out.println(set.ceiling(n));
  		}
  		return;
  	}
   
  	static class Kattio extends PrintWriter {
  		private BufferedReader r;
  		private StringTokenizer st;
   
  		// standard input
  		public Kattio() { this(System.in, System.out); }
  		public Kattio(InputStream i, OutputStream o) {
  			super(o);
  			r = new BufferedReader(new InputStreamReader(i));
  		}
  		// USACO-style file input
  		public Kattio(String problemName) throws IOException {
  			super(new FileWriter(problemName + ".out"));
  			r = new BufferedReader(new FileReader(problemName + ".in"));
  		}
   
  		// returns null if no more input
  		public String next() {
  			try {
  				while (st == null || !st.hasMoreTokens())
  					st = new StringTokenizer(r.readLine());
  				return st.nextToken();
  			} catch (Exception e) { }
  			return null;
  		}
   
  		public int nextInt() { return Integer.parseInt(next()); }
  		public double nextDouble() { return Double.parseDouble(next()); }
  		public long nextLong() { return Long.parseLong(next()); }
  	}
  }