Problem F
Peculiar primes

The level of corruption in some countries is really high. It is hard to imagine that these unethical manners have already hit the academic field. Some rumors are spreading that some students tried to bribe their lecturers to get better grades. Would you believe it?

But the real situation may be even much worse. ACM has a very strong suspicion that somebody has bribed mathematicians in the Academy of Sciences in order to forge some of their results. In particular, it is suspected that a very influential person wants to prefer some prime numbers over others.

It is said that many mathematicians have already completely stopped using some primes and they create only those numbers that can be “assembled” without those primes. Your task is to verify this hypothesis.

Given a set of prime numbers, your program should output all integer numbers that can be created solely by multiplying these primes, without using any other primes.

Input Specification

The input will consist of several test scenarios. Each scenario starts by a line with a single positive integer $N$ ($1\leq N\leq 10$) – the number of primes in the set.

On the second line of a scenario, there are $N$ integer numbers $2\leq P_1 < P_2 < P_3 < \dots < P_ N < 10000$, separated by a space. You are guaranteed that all these numbers are prime.

On the third line of each scenario, there are 2 integers $X$ and $Y$ ($1\leq X\leq Y <2^{31}$), separated by a space.

The last scenario is followed by a line containing a single zero.

Output Specification

Your task is to print all positive integer numbers in the closed interval $[X,Y]$ that have no other prime factors than those given in the input ($P_ i$). Print all such numbers in the increasing order, with no duplicates and separated by a single comma character (“,”). If there are no such numbers, print the word “none” instead.

Note that the number 1 does not need any primes to be constructed and is therefore always allowed.

Sample Input 1 Sample Output 1
1 12
2 3
10 20
2 3 5
20 30
20 30

Please log in to submit a solution to this problem

Log in