#include <queue>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int n;
struct F{
	int p;
	queue<int> f;
};
// push_back;
// pop_front

int main(){
	int i,j,k,x,y,ti,tm;
L1:	scanf("%d",&n);
	if(n==0){ return 0; }
	{ struct F f[10]; 
	for(i=0;i<n;i++)scanf("%d",&f[i].p);
	scanf("%d %d",&x,&y);
	for(i=0;i<n;i++)f[i].f.push(f[i].p); 

	if(x==1){ printf("1"); j = 1; }
	else j = 0;
	
	while(1){
		// pick min
		tm = y+1;
		for(i=0;i<n;i++){
			if( f[i].f.empty() ) continue;
			if( tm == f[i].f.front() ) { f[i].f.pop(); } else
			if( tm > f[i].f.front() ){ tm=f[i].f.front(); ti = i; }
			
		}
		i = ti;
		if( tm > y )break;
		else
			tm = f[i].f.front();
			f[i].f.pop();
			for(i=0;i<n;i++){
				if(tm * f[i].p <= y )f[i].f.push( tm * f[i].p );
			}
		if( tm >= x ){ if(j)printf(",%d",tm); else{ printf("%d",tm); j = 1; } }
	}
	if( j == 0 ) printf("none");
	printf("\n"); }
	goto L1;
}