#include <stdio.h>
#include <queue>
#include <algorithm>
using namespace std;



struct TMP{
	long long int x,last;
	TMP (long long int xx, long long int llast){x=xx; last = llast;}
} ;

int operator<(const TMP& a, const TMP& b)
{
	return a.x > b.x;	
}


int main()
{
	long long int N, mn, mx;
	long long int prv[16];
	while(1)
	{
		priority_queue <TMP> pq;
		scanf("%lld", &N);
		if (N==0)
			return 0;
		N++;
		for(int i=1; i<N; i++)
		{
			scanf("%lld", &prv[i]);
			//printf("prv - %lld\n", prv[i]);
			
		}
		prv[0] = 1;
		scanf("%lld %lld", &mn, &mx);
		//printf("%lld %lld %lld", N, mn, mx);
		pq.push(TMP(1, 0));
		bool prvn = true;
		while(1 && !pq.empty())
		{
			TMP tmp = pq.top();
			//printf(" <%lld> ", tmp.x);fflush(stdout);
			pq.pop();
			if (tmp.x>mx)
			{
				/*if (!prvn)
					printf("\n");*/
				break;
			}
			if (tmp.x>=mn)
				if (prvn)
				{
					printf("%lld", tmp.x);
					prvn=0;
				}
				else
					printf(",%lld", tmp.x);
			if (tmp.last!=0)
				pq.push(TMP(tmp.x*prv[tmp.last], tmp.last));
			//printf("|lld %lld %lld|", tmp.last, N);
			if (tmp.last<N-1)
			{
				long long int s  = tmp.x / prv[tmp.last]*prv[tmp.last+1];

				if (s<=mx && tmp.last<N-1)
				{
					pq.push(TMP(s, tmp.last+1));
				}
			}
		}
		if (prvn)
			printf("none\n");
		else
			printf("\n");
		
	
		
	}
	return 0;
}