prime_sieve()

```python ```python def rotate(s): return [s[n:] + s[:n] for n in range(1, len(s))] s = set('024568') L = int(input("Enter a search limit less than 1,000,000? ")) primes = set(['2','5']+[p for p in map(str, prime_sieve(L)) if not set(p).intersection(s)]) circular_primes = [int(p) for p in primes if all(pr in primes for pr in rotate(p))] print ("Number of circular primes below", L, " is",len(circular_primes)) print ("They are:", sorted(circular_primes), " With a sum of",sum(circular_primes))