import java.io.*;
import java.util.*;

public class pp
{
	
	public static void main(String[] args) throws Exception
	{
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		
		String s;
		
		while (true)
		{
			s = bf.readLine();
			
			if (s.equals("0"))
				break;
			
			int n = Integer.parseInt(s);
			
			int[] p = new int[n];
			s = bf.readLine();
			StringTokenizer st = new StringTokenizer(s);
			for(int i = 0; i < n; i++)
			{
				p[i] = Integer.parseInt(st.nextToken());
			}
			
			s = bf.readLine();
			st = new StringTokenizer(s);
			
			int min = Integer.parseInt(st.nextToken());
			int max = Integer.parseInt(st.nextToken());
			
			
			ArrayList<Integer> list = new ArrayList<Integer>();
			
			int [] m = new int [n];
			
			for (int i=0;i<n;i++)
			{
				m[i] = (int)(Math.log(max)/Math.log(p[i]));
			}
			
			int[] e = new int[n];
			
			for(int i = 0; i < n; i++)
				e[i] = 0;
			
			while(true)
			{
				int r = 1;
				for(int i = 0; i < n; i++)
				{
					r = r * (int)Math.pow(p[i], e[i]);
				}
				
				if((r >= min) && (r <= max))
					list.add(r);
				
				if(!plus(e, m))
				{
					break;
				}
			}
			
			if(list.size() == 0)
				System.out.println("none");
			else
			{
				String str = "";
				Collections.sort(list);
				for(Integer i: list)
				{
					str += i + ",";
				}
				System.out.println(str.substring(0, str.length() - 1));					
			}
			
		}
		
		
	}
	
	
	public static boolean plus(int[] e, int[] m)
	{
		int i = 0;
		
		while(true)
		{
			if(i >= e.length) return false;
			e[i]++;
			if(e[i] <= m[i]) return true;
			i++;
			e[i - 1] = 0;
		}
		
		
		
	}
	
	
	
}