#include<iostream>
#include<vector>

#define ll long long int
using namespace std;


vector<ll> P;

int MAX = 1000000;

bool U[1000][1000000];

vector<ll> res;

int main()
{
	int N;
	cin >> N;
	while(N!=0)
	{
		P.resize(N);
		for(ll i=0; i<N; i++) cin >> P[i];
		ll A, B;
		cin >> A >> B;
		//int p = A-1; //posun
		//int d = B-A+1;
		for(ll i=A; i<B+1; i++) U[i/MAX][i%MAX]=0;
		
		U[0][1]=1;
		for(ll i=0; i<N; i++)
		{
			for(ll j=1;j<=B;j++)if(U[j/MAX][j%MAX])
			{
				ll k=j;
				while (k<=B)
				{
					U[k/MAX][k%MAX] = 1;
					k=k*P[i];
				}
			}
		}
		res.resize(0);
		for(ll i=A; i<=B+1; i++) if (U[i/MAX][i%MAX]) res.push_back(i);
		
		if (res.size()==0) cout << "none" << endl;
		else
		{ 
			cout << res[0];
			if (res.size()>1)for(ll i=1; i<res.size();i++) cout <<","<< res[i];
			cout << endl;
		}
		cin >> N;
	}
	
	return 0;
}