#include <stdio.h>
#include <map>

using namespace std;
int n,x,y,index;
int primes[11];
map <int,bool> output;

void solution(int prev){
	if(prev<=y)
	{
		if(prev>=x)
			output[prev] = true;
		for(int a=0;a<n;a++)
			solution(prev * primes[a]);
	}
}
int min(int a,int b){
	if (a<b) return a;
	return b;
}
int main(){
	while(scanf("%d",&n)==1)
	{
		if(n==0)
			break;
		index=0;
		int lowestP = 10000;
		for(int a=0;a<n;a++)
		{
			scanf("%d",&primes[a]);
			lowestP = min(lowestP,primes[a]);
		}
		scanf("%d %d",&x,&y);
		solution(1);
		if(!output.empty())
		{
			map<int,bool>::iterator iter;
			int s = output.size(),a=0;
			for(iter = output.begin();iter!=output.end();iter++)
			{
				printf("%d",(*iter).first);
				if(a<(s-1))
					printf(",");
				a++;
			}
		}
		else
			printf("none");
		printf("\n");
		output.clear();

	}
	return 0;
}