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

class pp {

	public static boolean isPrime(int number)
	{
		int half = number / 2;
		for (int i = 2; i <= half; i++) {
			if (number % i == 0) {
				return false;
			}
		}
		return true;
	}

	public static void main(String[] args) {
		BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
		ArrayList<Integer> primes = new ArrayList<Integer>();
		for (int i = 2; i < 10000; i++) {
			if (isPrime(i)) {
				primes.add(i);
			}
		}
		String line;
		String[] numbers;
		try {
			while( (line = stdin.readLine()) != null) {
				if (line.compareTo("0") == 0) {
					System.out.println("none");
					break;
				}
				int[] de = new int[Integer.parseInt(line)];
				line = stdin.readLine();
				String numbs[] = line.split(" ");
				for (int i = 0; i < numbs.length; i++) {
					de[i] = Integer.parseInt(numbs[i]);
				}					
				line = stdin.readLine();
				String n[] = line.split(" ");
				int begin = Integer.parseInt(n[0]);
				int end = Integer.parseInt(n[1]);
				ArrayList<Integer> toWrite = new ArrayList<Integer>();

				for (int i = begin; i <= end; i++) {
					
					if (i == 1) {
						toWrite.add(i);
						continue;
					}
					for (int k : primes) {
						if (i % k == 0) {
							boolean write = false;
							for (int l : de) {
								if (l == k) {
									write  = true;
								}
							}
							if (write) {
								toWrite.add(i);
							}
							else {
								toWrite.remove(((Integer) i));
							}
						}
					}
				}				
				int k = 0;

				int[] ww = new int[toWrite.size()];
				for (int i = 0; i < ww.length; i++) {
					ww[i] = toWrite.get(i);
				}

				Arrays.sort(ww);

				int last = -1;
				for (int i = 0; i < ww.length; i++) {
					if (last != ww[i]) {
						if (k > 0) {
							System.out.print(",");
						}				
						System.out.print(ww[i]);
						last = ww[i];
						k = 1;
					}

					if (i == ww.length -1) {
						System.out.println();
					}

				}


			}
		} catch (IOException ex){}
	}
}