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: from itertools import product
  from bisect import bisect_left
  linput = lambda: [*map(int, input().split())]
  output = []
  
  
  def lprint(*x):
      output.append(' '.join(map(str, x)))
  
  
  def main():
      n, k = linput()
      if k == 2:
          lprint(a[bisect_left(a, n)])
      else:
          lprint(b[bisect_left(b, n)])
  
  
  if __name__ == '__main__':
      a = set([sum([(10 ** ind * x[-ind - 1]) for ind in range(l)]) for l in range(2, 11) for i in range(10) for j in range(i + 1, 10) for x in product([i, j], repeat=l)])
      b = sorted([int(str(i) * l) for l in range(1, 11) for i in range(1, 10)])
      a = sorted(list(a))
      for _ in ' ' * int(input()):
          main()
      print(*output, sep='\n')