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 bisect
  import itertools
  import sys
  input = sys.stdin.readline
  
  t = int(input())
  s1 = set()
  s2 = set()
  for i in range(1, 11):
      p = [j for j in range(i)]
      for j in range(1, i + 1):
          for p0 in itertools.combinations(p, j):
              for k in range(10):
                  x = [str(k)] * i
                  s1.add(int("".join(x)))
                  s2.add(int("".join(x)))
                  for l in range(k + 1, 10):
                      for m in p0:
                          x[m] = str(l)
                      s2.add(int("".join(x)))
  s1 = list(s1)
  s1.sort()
  s2 = list(s2)
  s2.sort()
  for _ in range(t):
      n, k = map(int, input().split())
      if k == 1:
          ans = s1[bisect.bisect_left(s1, n - 0.5)]
      else:
          ans = s2[bisect.bisect_left(s2, n - 0.5)]
      print(ans)