#include <iostream>
#include <string>
#include <sstream>
#include <set>
#include <utility>
#include <algorithm>
#include <queue>

using namespace std;

int N;
int p[11];
int X, Y;
long long tmp;
vector<int> out;

void tst(long long max, int minpid)
{
	for(int i = minpid; i<N; i++)
	{
		tmp = max*p[i];
		//cout << tmp << endl;
		
		if (tmp<=Y)
		{
			if (X<=tmp)
			{
				out.push_back(tmp);			
			}
			
			tst(tmp, i);
		}
	}
}

int main()
{
	cin >> N;
	
	while(N > 0)
	{
		out.clear();
		for(int i = 0; i < N; i++)
		{
			cin >> p[i];
		}
		
		cin >> X >> Y;
		
		//cout << N << endl;
		
		for(int i = 0; i < N; i++)
		{
			tst(1, i);
		}
		
		if(X == 1)
		{
			out.push_back(1);
		}
		
		sort(out.begin(), out.end());
		
		if (out.size() > 0)
		{
			cout << out[0];
			for(int i = 1; i < out.size(); i++)
			{
				if(out[i]!=out[i-1])
				{
					cout << "," << out[i];
				}
			}		
		}
		else
		{
			cout << "none";
		}
		cout << endl;
		
		cin >> N;
	}

	return 0;
}