input: from typing import List
  
  
  def get_prime_factors(n: int) -> List[int]:
      """ Produce a list of prime factors for the provided integer, listed in ascending order.
      Each factor appears in the list as many times as it is present in the prime factorization of the number.
      The product of all elements in the returned list should equal the given number.
      >>> get_prime_factors(8)
      [2, 2, 2]
      >>> get_prime_factors(25)
      [5, 5]
      >>> get_prime_factors(70)
      [2, 5, 7]
      """
output:     def get_prime_factors(n: int) -> List[int]:
      factors = []
      divisor = 2
      while n >= 2:
          while n % divisor == 0:
              factors.append(divisor)
              n //= divisor
          divisor += 1
      return factors