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: #Fast I/O
  import sys,os
  
  #User Imports
  from math import *
  from bisect import *
  from heapq import *
  from collections import *
  
  # To enable the file I/O i the below 2 lines are uncommented.
  # read from in.txt if uncommented
  if os.path.exists('in.txt'): sys.stdin=open('in.txt','r')
  # will print on Console if file I/O is not activated
  #if os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')
  
  # inputs template
  from io import BytesIO, IOBase
  
  def main():
      for _ in range(int(input())):
          n,k=input().split()
          k=int(k)
          def rec(idx,cur,ss):
              nonlocal n,k
              if len(ss)>k or cur<n[:idx]:return 
              if idx==len(n):return cur
              for i in range(10):
                  toRem=False
                  if str(i) not in ss:
                      toRem=True
                      ss.add(str(i))
                  f=rec(idx+1,cur+str(i),ss)
                  if toRem:ss.remove(str(i))
                  if f:return f
          print(rec(0,'',set()))
              
  # region fastio
  
  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")
  
  #for array of integers
  def MI():return (map(int,input().split()))
  # endregion
  #for fast output, always take string
  def outP(var): sys.stdout.write(str(var)+'\n')  
  # end of any user-defined functions
  
  MOD=10**9+7
  mod=998244353
  
  # main functions for execution of the program.
  
  if __name__ == '__main__':  
      #This doesn't works here but works wonders when submitted on CodeChef or CodeForces 
      main()