from euler.primes import prime_sieve


def compute() -> str:
    sieve = prime_sieve(10_000)
    primes = [i for (i, is_prime) in enumerate(sieve) if is_prime and i > 4_817]
    for prime in primes:
        first, third = prime - 3_330, prime + 3_330
        if sieve[first] and sieve[third] and set(str(first)) == set(str(prime)) == set(str(third)):
            return str(first) + str(prime) + str(third)

from euler.primes import prime_sieve


def compute() -> str:
    sieve = prime_sieve(10_000)
    primes = [i for (i, is_prime) in enumerate(sieve) if is_prime and i > 4_817]
    for prime in primes:
        first, third = prime - 3_330, prime + 3_330
        if sieve[first] and sieve[third] and set(str(first)) == set(str(prime)) == set(str(third)):
            return str(first) + str(prime) + str(third)
