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


get "libhdr"
 
let kprime(n, k) = valof
$(  let f, p = 0, 2
    while f<k & p*p<=n do
    $(  while n rem p = 0 do
        $(  n := n/p
            f := f+1
        $)
        p := p+1
    $)
    if n > 1 then f := f + 1
    resultis f = k
$)
 
let start() be
$(  for k=1 to 5 do
    $(  let i, c = 2, 0
        writef("k = %N:", k)
        while c < 10 do
        $(  if kprime(i, k) then
            $(  writed(i, 4)
                c := c+1
            $)
            i := i+1
        $)
        wrch('*N')
    $)
$)