**undecimal**digits from 0 to A exactly once each in the list. What is the minimum sum of all the numbers in such a list? What's the minimum product of all the numbers in such a list? (None of the primes may admit leading zeroes).

__Note__: Think of this problem as an extension of

**Pretty Potent Primes**.