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 itertools
  import bisect
  
  a1 = []
  m = 1
  for j in itertools.combinations(range(10), m):
      for n in range(1, 10):
          for i in itertools.product(*[j] * n):
              if i[0] != 0 and len(set(i)) == m:
                  a1.append(int("".join(map(str, i))))
  a1.sort()
  a2 = a1.copy()
  m = 2
  for j in itertools.combinations(range(10), m):
      for n in range(1, 10):
          for i in itertools.product(*[j] * n):
              if i[0] != 0 and len(set(i)) == m:
                  a2.append(int("".join(map(str, i))))
  a2.sort()
  for i in range(int(input())):
      n, k = map(int, input().split())
      if n == 10 ** 9:
          if k == 2:
              print(n)
              continue
          else:
              print("1111111111")
              continue
      if k == 1:
          w = bisect.bisect_right(a1, n)
          if w > 0 and a1[w - 1] == n:
              print(n)
          else:
              print(a1[w])
      else:
          w = bisect.bisect_right(a2, n)
          if w > 0 and a2[w - 1] == n:
              print(n)
          else:
              print(a2[w])
  