Try to print all the integers divisible by 8 in this range.

Let's write the number in the form $$$2^kr$$$ where $$$r$$$ is odd. The number of even divisors is then $$$k\cdot d(r)$$$. Thus, $$$k$$$ can be $$$1$$$ or $$$3$$$. If it is $$$3$$$, then $$$d(r)=1 \implies r=1$$$, which is impossible in the given range.

Now we know that $$$k=1$$$ and $$$d(r)=3$$$. The latter can only happen when $$$r$$$ is a square of some prime number $$$r=p^2$$$. Finally, to find all such numbers, you should iterate over all even numbers in the given range, divide them by $$$2$$$, check whether the quotient is a perfect square, and finally check whether its square root is prime. To check whether $$$\sqrt{r}$$$ is prime you can either use a brute-force solution (you will only check numbers up to $$$\approx 100$$$) or precompute all prime numbers up to $$$\approx 10^4$$$.