input: from typing import List
  
  def prime_decomposition(n: int) -> List[int]:
      """ Provide a list of prime divisors of the specified integer, sorted from smallest to largest.
      Every divisor is included as many times as it appears in the decomposition.
      The original number should be the product of all listed divisors.
      >>> prime_decomposition(8)
      [2, 2, 2]
      >>> prime_decomposition(25)
      [5, 5]
      >>> prime_decomposition(70)
      [2, 5, 7]
      """
output:     def prime_decomposition(n: int) -> List[int]:
      divisors = []
      divisor = 2
      while n >= divisor**2:
          while n % divisor == 0:
              divisors.append(divisor)
              n //= divisor
          divisor += 1
      if n > 1:
          divisors.append(n)
      return divisors