Several sets of prime numbers, such as {7,83,421,659} use each of the nine nonzero digits exactly once. What is the smallest possible sum such a set of primes could have?
<spanclass=′latex−bold′>(A)</span>193<spanclass=′latex−bold′>(B)</span>207<spanclass=′latex−bold′>(C)</span>225<spanclass=′latex−bold′>(D)</span>252<spanclass=′latex−bold′>(E)</span>447