Used Sieve to generate primes till 10^6, and then used those primes to generate larger primes.
counted all such numbers satisfying  L <= p^(q-1) <=R where p & q are primes (q>2). Subtracted it from R-L+1

How to optimize?