#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <cassert>
#include <cmath>
#include <cstdlib>

using namespace std;

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

#define pb push_back
#define fi first
#define se second

int main()
{
	while(1)
	{
		int n;
		scanf("%d", &n);
		if(n==0) break;
		long long p[15];
		for(int i = 0; i < n; i++)
			scanf("%Ld", &p[i]);
		long long X, Y;
		scanf("%Ld %Ld", &X, &Y);
		vector<long long> all;
		all.push_back(1);
		for(int i = 0; i < n; i++)
		{
			vector<long long> temp(all);
			vector<long long> temp2;
			while(temp.size()>0)
			{
				temp2.clear();
				for(int j = 0; j < temp.size(); j++)
				{
					if(temp[j]*p[i]<=Y)
						temp2.push_back(temp[j]*p[i]);
				}
				swap(temp, temp2);
				for(int j = 0; j < temp.size(); j++)
					all.pb(temp[j]);
//				printf("zr\n");
			}
		}
		sort(all.begin(), all.end());
		bool v = false;
		for(int i = 0; i < all.size(); i++)
		{
			if(all[i]>=X)
			{
				v = true;
				if(i==all.size()-1)
				{
					printf("%Ld\n", all[i]);
				}
				else
					printf("%Ld,", all[i]);
			}
		}
		if(!v)
			printf("none\n");
	}
	return 0;
}