Reversible Primes

def solve(n, d):
    def is_prime(x):
        if x < 2:
            return False
        for i in range(2, int(x**0.5) + 1):
            if x % i == 0:
                return False
        return True
    def reverse_in_base(num, base):
        result = 0
        while num:
            result = result * base + num % base
            num //= base
        return result
    if is_prime(n) and is_prime(reverse_in_base(n, d)):
        print('Yes')
    else:
        print('No')