def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def find_primes(digits, start):
    primes = []
    for num in range(10**(digits-1)*start, 10**(digits-1)*(start+1)):
        if is_prime(num):
            primes.append(num)
    return primes

digits = 3
start = 5
prime_numbers = find_primes(digits, start)
print(prime_numbers)