#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>

#include <iostream>
#include <sstream>
#include <string>

#include <vector>
#include <list>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <algorithm>
using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR2(i,a,b) for (int i = (a); i > (b); ++i)
/*
#define FOR(i,n) for(int i=0; i < (n); i++)
#define FORD(i,n) for(int i=(n)-1; i >= 0; i--)
#define FORTO(i,a,b) for (int i = (a); i <= (b); ++i)
*/


#define DEBUG(x) cout << '>' << #x << ' ' << x << endl;
#define SIZE(x) int(x.size())

typedef pair<int, int> PII;
typedef long long ll;

int N;
ll primes[10];
ll X, Y;

vector<ll> res;

void go(ll num, int ind)
{
	if (ind == N || num > Y) return;
	
	go(num, ind+1);
	
	num *= primes[ind];
	if (num >= X && num <= Y) res.push_back(num);
	go(num, ind);
}

int main()
{
	while (1)
	{
		scanf("%d", &N);
		if (!N) break;
		FOR(i, 0, N) scanf("%lld", &primes[i]);
		scanf("%lld%lld", &X, &Y);
		
		res.clear();
		if (X <= 1 && 1 <= Y)
			res.push_back(1);
		go(1, 0);
		
		sort(res.begin(), res.end());
		FOR(i, 0, res.size())
		{
			if (i) printf(",");
			printf("%lld", res[i]);
		}
		if (res.empty()) printf("none");
		printf("\n");
	}
	
	return 0;
}