#include <iostream>
#include <set>
using namespace std;

int N,X,Y;
int P[11];
set<int> S;

void f(int w, int n){
	if (w == -1){
		if (X <= n && Y >= n) S.insert(n);
		return;
	}
	long long nn = n;
	while(nn <= Y){
		f(w-1,nn);
		nn*=P[w];
	}
	return;
}

int main(){
	while(true){
		cin >> N;
		if (N == 0)break;
		for (int i=0;i<N;i++)cin >> P[i];
		cin >> X >> Y;
		S.clear();
		f(N-1,1);
		if (S.size() == 0) cout << "none";
		for(set<int>::iterator it = S.begin(); it!=S.end(); it++){
			int p = *it;
			if (it == S.begin()){
				cout << p;
			}else{
				cout << "," << p;
			}
		}
		cout << endl;
	}
	
}