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, m = map(int, input().split())
      if(m == 1):
          s = str(n)
          if(n <= int(s[0] * len(s))):
              print(int(s[0] * len(s)))
          else:
              print(int(str(int(s[0]) + 1) * len(s)))
      else:
          A = list(str(n))
          if(min(A) == max(A)):
              print(n)
          else:
              x = -1
              s = str(n)
              for i in range(len(A) - 1):
                  if(A[i] != A[i + 1]):
                      x = i + 1
                      break
              if(n <= int(s[:x + 1] + str(max(int(s[x]), int(s[x - 1]))) * (len(s) - x - 1))):
                  #print(int(s[:x + 1] + str(max(int(s[x]), int(s[x - 1]))) * (len(s) - x - 1)))
                  Ans = s[:x + 1]
                  mi = str(min(int(s[x]), int(s[x - 1])))
                  ma = str(max(int(s[x]), int(s[x - 1])))
                  for i in range(x + 1, len(s)):
                      if(int(Ans + mi + ma * (len(s) - i - 1)) >= n):
                          Ans += mi
                      else:
                          Ans += ma
                  print(Ans)
              else:
                  if(int(s[x]) + 1 == int(s[0])):
                      print(int(s[:x] + str(int(s[x]) + 1) + '0' * (len(s) - x - 1)))
                  else:
                      print(int(s[:x] + str(int(s[x]) + 1) + str(min(int(s[x]) + 1, int(s[x - 1]))) * (len(s) - x - 1)))