#include <iostream>

#include <vector>

using namespace std;

unsigned int reduce (unsigned int base, int prime) {
	while (base % prime == 0) {
		base /= prime;
	}
	return base;
}

bool solve () {
	unsigned int primeCount = 0;
	unsigned int lowerBound = 0;
	unsigned int upperBound = 0;
	bool written=false;
	vector<int> primes;
	cin >> primeCount;
	if (primeCount == 0) {
		return false;
	}
	for (unsigned int i = 0; i < primeCount; i++) {
		int tmp;
		cin >> tmp;
		primes.push_back(tmp);
	}

	cin >> lowerBound;
	cin >> upperBound;
	for (unsigned int i = lowerBound; i <= upperBound; i++) {
		unsigned int number = i;
		for (unsigned int j = 0; j < primeCount; j++) {
			number = reduce(number, primes[j]);
		}
		if (number == 1) {
			if(written) {
				cout << ",";
				} else 
				written=true;
			cout << i;
		}
	}
	if(!written)
		cout << "none";
	cout << endl;
	return true;
}

int main () {
	while (solve());
	return 0;
}