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: '''Author- Akshit Monga'''
  from sys import stdin, stdout
  input = stdin.readline
  t = int(input())
  for _ in range(t):
      n,k=map(int,input().split())
      arr=[i for i in str(n)]
      l=len(arr)
      if len(set(arr))<=k:
          print(n)
          continue
      ans=-1
      for i in range(0,l):
          s=set()
          vals=[]
          for j in arr[:i]:
              s.add(j)
              vals.append(j)
          p=len(s)
          if p>k or arr[i]=='9':
              continue
          if p<k:
              vals.append(str(int(arr[i])+1))
              s.add(str(int(arr[i])+1))
          else:
              mi=float('inf')
              for j in s:
                  if int(j)>int(arr[i]):
                      mi=min(mi,int(j))
              if mi==float('inf'):
                  continue
              vals.append(str(mi))
          mi=0
          p=len(s)
          if p==k:
              mi=float('inf')
              for j in s:
                  mi=min(mi,int(j))
          mi=str(mi)
          # print(mi)
          for j in arr[i+1:]:
              vals.append(str(mi))
          ans=''.join(vals)
          # print(i,ans)
      try:
          ans=int(ans)
          print(ans)
      except:
          print(n,k,ans)