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
  input = sys.stdin.readline
  from pprint import pprint
  
  INF = 1 << 63
  l = list()
  def f():
      nn = 10
      ss = set()
      for n in range(nn+1):
          for a in range(10):
              for b in range(10):
                  for pat in range(2 ** n):
                      x = 0
                      for i in range(n):
                          x *= 10
                          if (pat >> i) & 1 == 1:
                              x += b
                          else:
                              x += a
                      ss.add(x)
      for x in ss: l.append(x)
      l.sort()
  
  
  def do():
      from bisect import bisect_left
      n, k = map(int, input().split())
      s = str(n)
      sl = len(str(n))
      if s.count(s[0]) == sl:
          print(s)
          return
      if k == 1:
          for i in range(1,10):
              if int(str(i)*sl) >= n:
                  print(str(i)*sl)
                  return
      # k == 2
      ind = bisect_left(l, n)
      print(l[ind])
  
  
  f()
  #print(len(l))
  #for x in l:
  #    if  100000 <= x <= 200000:
  #        print(x)
  q = int(input())
  for _ in range(q):
      do()