```
import time
start_time = time.time()
product = 0
num1 = 100
num2 = 100
while num1 <= 999:
while num2 <= 999:
product = num1*num2
print(product, num1, num2)
product = str(product)
if product == product[::-1]:
print("*****", product, num1, num2)
num2+=1
num1+=1
print("Process finished --- %s seconds ---" % (time.time() - start_time))
```

I am trying to find the largest palindrome that can be found from multiplying 2 3-digit numbers

For some reason, num2 iterates as usual, but num1 stays at 100

I donâ€™t get why this is