A   k-Almost-prime   is a natural number   



n


{\displaystyle n}

   that is the product of   



k


{\displaystyle k}

   (possibly identical) primes.



Example

1-almost-primes,   where   



k
=
1


{\displaystyle k=1}

,   are the prime numbers themselves.

2-almost-primes,   where   



k
=
2


{\displaystyle k=2}

,   are the   semiprimes.



Task

Write a function/method/subroutine/... that generates k-almost primes and use it to create a table here of the first ten members of k-Almost primes for   



1
<=
K
<=
5


{\displaystyle 1<=K<=5}

.



Related tasks

   Semiprime
   Category:Prime Numbers


# Converted from C
kprime = (n, k):
  p = 2, f = 0
  while (f < k && p*p <= n):
    while (0 == n % p):
      n /= p
      f++.
    p++.
  n = if (n > 1): 1.
      else: 0.
  f + n == k.
 
1 to 5 (k):
  "k = " print, k print, ":" print
  i = 2, c = 0
  while (c < 10):
    if (kprime(i, k)): " " print, i print, c++.
    i++
  .
  "" say.