Find the largest palindrome made from the product of two three-digit numbers

A palindromic number reads the same both ways. For example, 1234321 is a palindrome. The largest palindrome made from the product of two two-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two three-digit numbers.

def palin(A, B):
french = str(0)
for A in range(999, 100, -1):
for B in range(999, A, -1):
toast = str(A * B)
syrup = str(toast[::-1])
if toast == syrup and toast > french:
french = toast
return french, A, B
palin(100,999)

(‘888888’, 924, 962)

I cannot seem to get the correct answer. I know my code as all the right elements but I’m not sure if it is a problem with indentation or the loops are not properly set.