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 sys
  t = int(input())
  for i in range(t):
      n,k = sys.stdin.readline().split()
      n = n.lstrip("000000000")
      k = int(k)
      L = [n[0]]
      for s in n:
          if s not in L:
              L.append(s)
      if len(L)<=k:
          print(n)
      elif k == 1:
          if L[1]<L[0]: print (L[0]*len(n))
          else: print (str(int(L[0])+1)*len(n))
      else:
          x,y = int(L[0]),int(L[1])
          Num = list(map(int,n))
          ind = Num.index(y)
          bada = False
          i=0
          while i<len(n):
              if bada:
                  Num[i] = min(x,y)
              else:
                  if Num[i]>max(x,y):
                      bada = True
                      while Num[i]+1>max(x,y) and i>ind:
                          i-=1
                      Num[i]+=1
                      if(i == ind):
                          y+=1
                          if x == y: y = 0
                              
              i+=1
              #print(i,bada,Num)
          bada = False
          for i in range(len(Num)):
              if bada == True:
                  Num[i] = min(x,y)
              else:
                  if (Num[i]!=x and Num[i]!=y): bada = True
                  if Num[i]>min(x,y): Num[i] = max(x,y)
                  else: Num[i] = min(x,y)
          print(int(''.join(list(map(str,Num)))))
                      
                  
          
          