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: ali=0;from collections import defaultdict, Counter,deque;ali=0
  ali=0;
  ali=0;from math import sqrt, log10, log, floor, factorial;ali=0
  ali=0;
  ali=0;from bisect import bisect_left, bisect_right;ali=0
  ali=0;
  ali=0;from itertools import permutations,combinations;ali=0
  ali=0;
  ali=0;import sys, io, os;ali=0
  ali=0;
  ali=0;input = sys.stdin.readline;ali=0
  ali=0;
  ali=0;# input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline;ali=0
  ali=0;
  ali=0;# sys.setrecursionlimit(10000);ali=0
  ali=0;
  ali=0;inf = float('inf');ali=0
  ali=0;
  ali=0;mod = 10 ** 9 + 7;ali=0
  ali=0;
  def yn(a): print("YES" if a else "NO");ali=0
  ali=0;
  ali=0;ceil = lambda a, b: (a + b - 1) // b;ali=0
  ali=0;
  ali=0;uni=[];ali=0
  ali=0;
  ali=0;strings={str(i) for i in range(1,10)};ali=0
  ali=0;
  for i in strings:
      for j in range(1,11):
          ali=0;uni.append(int(i*j));ali=0
          ali=0;
  ali=0;uni.sort();ali=0
  ali=0;
  ali=0;doubleset=set();ali=0
  ali=0;
  def init(a,b,string):
      ali=0;
      if len(string)>=10:
          ali=0;return;ali=0
          ali=0;
      ali=0;
      if string:
          ali=0;doubleset.add(int(string));ali=0
          ali=0;
      ali=0;init(a,b,string+a);ali=0
      ali=0;
      ali=0;init(a,b,string+b);ali=0
      ali=0;
  for i in range(10):
      for j in range(i+1,10):
          ali=0;init(str(i),str(j),"");ali=0
          ali=0;
  
  ali=0;doub=sorted(doubleset);ali=0
  ali=0;
  
  ali=0;t=int(input());ali=0
  ali=0;
  for i in range(t):
      ali=0;n, k = [int(i) for i in input().split()];ali=0
      ali=0;
      ali=0;ncopy = n;ali=0
      ali=0;
      ali=0;n = str(n);ali=0
      ali=0;
      ali=0;s = set(n);ali=0
      ali=0;
      ali=0;
      if len(s) <= k:
          ali=0;print(n);ali=0
          ali=0;
          ali=0;continue;ali=0
          ali=0;
      ali=0;
      if k == 1:
          ali=0;print(uni[bisect_left(uni, ncopy)]);ali=0
          ali=0;
      else:
          ali=0;print(doub[bisect_left(doub,ncopy)]);ali=0
          ali=0;
  
  
  
  
  
  
  
  