The digital product P(N) of an integer N is the product of its decimal digits. So P(128)=16.

Determine all sets of distinct positive integers A and B such that A = P(B)P(C) and B = P(A)P(C) for some integer C.

For each pair, A and B, give the lowest possible value for C.