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, sys
  from io import BytesIO, IOBase
  from math import log2, ceil, sqrt, gcd
  from _collections import deque
  import heapq as hp
  from bisect import bisect_left, bisect_right
  from math import cos, sin
  
  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")
  
  mod = 10 ** 9 + 7
  
  for _ in range(int(input())):
      n,k=map(int,input().split())
      a=[int(i) for i in str(n)]
      ans=float('inf')
      for i in range(1,10):
          x=int(str(i)*len(a))
          if x>=n:
              ans=min(ans,x)
      if k==2:
          for i in range(10):
              for j in range(i+1,10):
                  ct=[]
                  bol=True
                  for k in range(len(a)):
                      if i==0 and len(ct)==0:
                          if a[k]>j:
                              bol=False
                              break
                          elif a[k]<j:
                              ct.append(j)
                              for kk in range(1,len(a)):
                                  ct.append(i)
                              break
                          else:
                              ct.append(j)
                      else:
                          if i>a[k]:
                              for kk in range(len(a)-k):
                                  ct.append(i)
                              break
                          if j>a[k]:
                              x=''.join(map(str,ct))+str(j)+str(i)*(len(a)-k-1)
                              if int(x) >= n:
                                  ans = min(ans, int(x))
  
                          if i==a[k]:
                              ct.append(i)
                              continue
  
                          if j==a[k]:
                              ct.append(j)
                              continue
                          bol=False
                          break
                  if bol:
                      x=int(''.join(map(str,ct)))
                      if x>=n:
                          ans=min(ans,x)
      print(ans)
  