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 sys, itertools, bisect
  
  res1 = set()
  res2 = set()
  for l in range(1,3):
      for i in itertools.combinations([a for a in range(10)], l):
          for j in range(1, 11):
              for k in itertools.product(i, repeat=j):
                  if k[0] == 0:
                      continue
                  if l == 1:
                      res1.add(int(''.join(map(str, k))))
                  else:
                      res2.add(int(''.join(map(str, k))))
  res1 = sorted(res1)
  res2 = sorted(res2)
  
  tc = int(sys.stdin.readline())
  for _ in range(tc):
      n, k = map(int, sys.stdin.readline().split())
      if k == 1:
          print(res1[bisect.bisect_left(res1, n)])
      else:
          print(res2[bisect.bisect_left(res2, n)])