\problem{A Terribly Grimm Problem}

\parpic[r]{\includegraphics[width=0.2\linewidth]{Grimm/numbers.jpg}}


Grimm's conjecture states that to each element of a set of consecutive
composite numbers one can assign a distinct prime that divides it.

For example, for the range 242 to 250, one can assign distinct primes
as follows:
\begin{center}
\begin{tabular}{|c|c|c|c|c|c|c|c|c|}
\hline
242 &
243 &
244 &
245 &
246 &
247 &
248 &
249 &
250 \\ \hline
2 &
3  &
61 &
7 &
41 &
13 &
31 &
83 &
5 \\ \hline
\end{tabular}
\end{center}
Given the lower and upper bounds of a sequence of composite numbers,
find a distinct prime for each. If there is more than one such
assignment, output the one with the smallest first prime. If there is
still more than one, output the one with the smallest second prime,
and so on.

\subsection*{Input}

There may be several data sets. 

Each data set will consist of a single line with two integers, $L$ and
$H$ ($4\leq L < H \leq 10^{10}$). It is guaranteed that all the
numbers in the range from $L\ldots H$, inclusive, are composite.

The input will end with a line with two 0s.

\subsection*{Output}

For each data set, print a single line containing the set of unique primes, in order, separated by a single space. 

\subsection*{Example}

Given the input
\verbfile{Grimm/sample.judge}

the output would be
\verbfile{Grimm/sample.out}
