Can anyone write this program in Python3 and give some explanation please?

Please write the code step by step , do not use advanced grammer, it will be hard to understand .

Thank you so much.

Write a program triples_1.py that finds all triples of positive integers (i,j, k) such that i, j and k are two digit numbers, no digit occurs more than once in i, j and k, and the set of digits that occur in i, j or k is equal to the set of digits that occur in the product of i, j andk The expected output is: 20 x 79 x 81 = 127980 21 x 76 x 80 = 127680 28 x 71 x 90 = 178920 31 x 60 x 74 = 137640 40 x 72 x 86 = 247680 46 x 72 x 89 = 294768 49 x 50 x 81 = 198450 56 x 87 x 94 = 457968