#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <iterator>


using namespace std;

typedef long long Number;

set<Number> numbers;
vector<Number>  primes;

enum Ret {
	OK, BIG, SMALL
	};

Number low, high;

Ret addNumber (Number num){
	if (num < low)
		return SMALL;
	if (num > high)
		return BIG;
	numbers.insert(num);
	return OK;
}

void mult (Number num){
	vector<Number>::iterator iter, end;
	for (iter = primes.begin(), end = primes.end(); iter != end; ++iter){
		if (addNumber(num * *iter) == BIG)
			break;
		mult (num * *iter);
	}
}

int main(int argc, char** argv){
	int primesCount;
	while (true){
		cin >> primesCount;
		if (primesCount == 0)
			break;
		primes.clear();
		primes.resize(primesCount);
		for (vector<Number>::iterator iter = primes.begin(), end = primes.end(); iter != end; ++iter)
			cin >> *iter;
		
		cin >> low >> high;
		
		numbers.clear();
		addNumber(1);
		mult (1);
		
		if (numbers.size() == 0)
			cout << "none\n";
		else {
			set<Number>::iterator iter = numbers.end();
			--iter;
			copy (numbers.begin(), iter, ostream_iterator<Number>(cout, ","));
			cout << *iter;
			cout << "\n";
		}
	}
	cout << flush;
	return 0;
}