#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX_NUMBERS 4294967296
#define MAX_PRIMES 10
unsigned int min, max, primes_cnt;
unsigned int primes[MAX_PRIMES];

int is_prime(int num) {
	int i;
	for(i = 0; i<num; i++)
		if(num%i == 0)
			return 0;
	return 1;
}

int in_primes(unsigned int item)
{
	int i;
	for (i = 0; i<primes_cnt; i++) 
		if(primes[i] == item)
			return 1;
	
	return 0;
}

int is_divisible(unsigned int num)
{
	int i, ret = 0;
	if(num == 1)
		return 0;
	for(i = 0; i<primes_cnt; i++)
		if(num%primes[i] == 0) {
			ret = 1;
			break;
		}
	if(ret == 0)
		return 1;
	/*printf("testovane cislo: %i\n", num);*/
	for(i=2; i<num; i++) {/*printf("i: %i\n", i);*/
		/*printf("i: %i, in_primes: %i\n", i, in_primes(i));*/
		if(num%i == 0 && !in_primes(i) && is_prime(i))
			return 1;
	}
	return 0;
}



int main()
{
	char found, line[1024];
	unsigned int i;
	unsigned int ui;
	
	ui = 4111222333;
	while(1) {
	if(scanf("%u\n", &primes_cnt) == EOF)
		break;
	if(primes_cnt == 0)
		break;
	
	/*scanf("%s\n", line);*/
	fgets (line, 1024, stdin);
	line[1023] = '\0';
	for (i=0; i<primes_cnt; i++){
		sscanf(line, "%u ", &(primes[i]));
	}
	scanf ("%u %u\n", &min, &max);


	found = 0;
	for (i=min; i<=max; i++){
		if (is_divisible(i)==0){
			if (found)printf (",");
			printf("%u", i);
			found = 1;
		}
	}
	if (!found) printf ("none");
	printf ("\n");}
	

	return 0;
}