from itertools import product

def is_palindrome(num):
    return str(num) == str(num)[::-1]
multiples = ((a, b) for a, b in product(range(100, 999), repeat=2) if
    is_palindrome(a * b))
highest palindrome with 3 digit numbers in python