#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<string>
#include<vector>
#include<deque>
#include<set>
#include<map>

using namespace std;

#define PB push_back()
#define SZ(x) ((int)x.size())
#define PI 3.141592653589
#define REP(i,N) for(int(i)=0;(i)<(int)(N);++(i))
typedef long long LL;
int N,P[55];
set<int> S;
int X,Y;
bool je_nieco;
void solve(int cur)
{
  if (S.find(cur)!=S.end()) return;
	if (cur>=X)je_nieco=1;
	S.insert(cur);
	REP(i,N)
	{
	  LL nxt=cur;
		nxt*=P[i];
		if (nxt<=Y)
			solve(nxt);	
	}
}
void solve_case()
{
	S.clear();
  je_nieco=0;
  REP(i,N)
		scanf("%d",&P[i]);
  scanf("%d %d",&X,&Y);
  solve(1);

  if (!je_nieco)
		puts("none");
  else
	{
		bool fst=1;
		for(set<int>::iterator it=S.begin();it!=S.end();it++)
			if (*it>=X)
			{
				if (fst)fst=0; else putchar(',');
				printf("%d",*it);
			}
		putchar(10);
	}
}

int main()
{
  while(scanf("%d",&N),N)
		solve_case();


	return 0;
}