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
  input = raw_input
  
  def first_bad(A, k):
      seen = [0] * 10
      for i,a in enumerate(A):
          if seen[a] == 0:
              k -= 1
              seen[a] = 1
          if k < 0:
              return i
      return -1
  
  t = int(input())
  for _ in range(t):
      n,k = [int(x) for x in input().split()]
  
      A = [ord(c) - ord('0') for c in str(n)]
      
      while True:
          i = first_bad(A, k)
          if i == -1:
              break
          A[i] += 1
          while i and A[i] == 10:
              i -= 1
              A[i] += 1
          for j in range(i + 1, len(A)):
              A[j] = 0
  
      print ''.join(str(x) for x in A)
  