2015 Pascal Problem 25

The first four rows of a table with columns V, W, X, Y, and Z are shown. For each row, whenever integer n appears in column V, column W contains the integer 2n + 1, column X contains 3n + 1, column Y contains 5n+1, and column Z contains 7n+1. For every row after the first, the number in column V is the smallest positive integer that does not yet appear in any previous row. The integer 2731 appears in column W. The complete list of columns in which 2731 appears is

\begin{array}{|c|c|c|c|c|}\hline V & W & X & Y & Z \\ \hline 1 & 3 & 4 & 6 & 8 \\ \hline 2 & 5 & 7 & 11 & 15 \\ \hline 9 & 19 & 28 & 46 & 64 \\ \hline 10 & 21 & 31 & 51 & 71 \\ \hline \end{array}

\textbf{(A)} W \textbf{(B)}\ W,\ X,\ Y, \text{ and } Z\quad \textbf{(C)}\ W,\ X \text{ and } Z\quad \textbf{(D)}\ W,\ Y \text{ and } Z\quad \textbf{(E)}\ W \text{ and } Z

If there are no answer choices shown, enter a numerical answer.

Full credit to this problem is given to the CEMC, you may view all Pascal contests here.