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 os
  import sys
  from io import BytesIO, IOBase
  import math
  
  BUFSIZE = 8192
  
  
  class FastIO(IOBase):
      newlines = 0
  
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = 'x' in file.mode or 'r' not in file.mode
          self.write = self.buffer.write if self.writable else None
  
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
  
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b'\n') + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
  
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  
  
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode('ascii'))
          self.read = lambda: self.buffer.read().decode('ascii')
          self.readline = lambda: self.buffer.readline().decode('ascii')
  
  
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip('\r\n')
  
  
  def ints_get(): return map(int, input().strip().split())
  
  
  def list_get(): return list(map(int, sys.stdin.readline().strip().split()))
  
  
  def chars_get(): return list(map(str, sys.stdin.readline().strip().split()))
  
  
  def output(to_be_printed, end="\n"): sys.stdout.write(str(to_be_printed) + end)
  
  
  # ******************************************************#
  # **************** code starts here ********************#
  # ******************************************************#
  
  def main():
      v = []
      for i in range(1, 100):
          v.append(i)
      p = []
      for i in range(3, 10):
          s = []
          q = []
          for j in range(i):
              q.append('a')
          s.append(q)
          while len(s) > 0:
              x = s.pop()
              for j in range(len(x)):
                  if x[j] == 'a':
                      x[j] = 'x'
                      if 'a' in x:
                          s.append(x.copy())
                      else:
                          p.append(x.copy())
                      x[j] = 'y'
                      if 'a' in x:
                          s.append(x.copy())
                      else:
                          p.append(x.copy())
                      break
      for i in range(10):
          for j in range(10):
              for k in p:
                  w = k.copy()
                  for l in range(len(w)):
                      if w[l] == 'x':
                          w[l] = str(i)
                      else:
                          w[l] = str(j)
                  q = ""
                  for h in w:
                      q += h
                  if v[len(v) - 1] != int(q):
                      v.append(int(q))
      v.append(10 ** 9)
      v.sort()
  
      v2 = []
      for i in range(1, 10):
          for j in range(1, 11):
              q = ""
              for k in range(j):
                  q += str(i)
              v2.append(int(q))
      v2.sort()
      o = [v[0]]
      for i in range(1, len(v)):
          if v[i] != o[len(o) - 1]:
              o.append(v[i])
  
      t = int(input())
      for u in range(t):
          n, k = ints_get()
          if k == 1:
              for i in v2:
                  if i >= n:
                      output(i)
                      break
          else:
              for i in o:
                  if i >= n:
                      output(i)
                      break
      return
  
  
  
  
  
  
  
  if __name__ == "__main__":
      main()
  