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

using namespace std;

int main(int argc, char**argv)
{
	while(true)
	{
		int pocet;
		vector<unsigned> prvocisla;
		unsigned long x, y;

		cin >> pocet;
		if (pocet == 0)
			break;
		int i;
		int neco;
		for (i=0;i<pocet;i++) {
			cin >> neco;
			prvocisla.push_back(neco);
		}
		cin >> x;
		cin >> y;

		//cout << "p: " << pocet << "x: " << x << "y: " << y << endl;
		
		vector<unsigned> souciny;
		souciny.push_back(1);
		
		bool flag = false;

		unsigned it = 0;
		unsigned last = 0;
		while (true) {
			if (souciny[it] > last) {
				if (souciny[it] > y) {
					if (!flag)
						cout << "none";
					cout << endl;
					break;
				}
				if (souciny[it] >= x) {
					if (flag)
						cout << ',';
					cout << souciny[it];
					flag = true;
				}
				
				for (unsigned h = 0; h < prvocisla.size(); ++h) {
					souciny.push_back(souciny[it] * prvocisla[h]);
					//cout << "souciny[it]: " << souciny[it] << " prvocisla[h]: " << prvocisla[h] << endl;
				}
				sort(souciny.begin(), souciny.end());
			}
			last = souciny[it];
			++it;			
		}
	}
	return 0;
}