SP134 PHONY - Phony Primes

You are chief debugger for Poorly Guarded Privacy, Inc. One of the top selling product, ReallySecureAgent©, seems to have a problem with its prime number generator. It produces from time to time bogus primes N. After a while, you realize that the problem is due to the way primes are recognized. Every phony prime N you discover can be characterized as follows. It is odd and has distinct prime factors, say  with , where the number k of factors is at least 3. Moreover, for all i=1..k,  divides N-1. For instance, 561 = 3\*11\*17 is a phony prime. Intrigued by this phenomenon, you decide to write a program that enumerates all such N's in a given interval  with . **Please note, that the source code limit for this problem is 2000 Bytes to avoid precalculated tables.**

Each test case contains one line. On this line are written two integers  and  separated by a blank. The end of the input is signalled by a line containing two zeros. The number of test cases is approximately 2000.

For each test case, output the list of phony primes in increasing order, one per line. If there are no phony primes in the interval, then simply output none on a line.