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: for _ in range(int(input())):
      n, k = map(int, input().split())
      s = str(n)
      m = int(len(s) * '1')
      for i in range(1, 10):
          if i * m >= n:
              ans = i * m
              break
      if k == 2:
          for i in range(9):
              for j in range(i + 1, 10):
                  flag = 0
                  for x in range(len(s)):
                      if int(s[x]) < j:
                          if int(s[x]) < i:
                              ans = min(ans, int(s[:x] + str(i) * (len(s) - x)))
                          ans = min(ans, int(s[:x] + str(j) + str(i) * (len(s) - x - 1)))
                      if s[x] != str(i) and s[x] != str(j):
                          flag = 1
                          break
                  if not flag:
                      ans = n
      print(ans)
  