#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>

using namespace std;

int powers[10];
long long lowerBound;
long long upperBound;
int n;
int primes[10];
set<int> compounds;

int makeCompound(void) {
    int result = 1;
    for (int i=0; i<n; i++) {
        result *= pow(primes[i], powers[i]);
    }
    return result;
}

/*
void genPrimes(int expIndex) {
    long long comp = makeCompound();
    if (comp >= lowerBound && comp <= upperBound) {
        compounds.push_back(comp);
    }
    
    powers[expIndex]++;
    if (makeCompound() > upperBound) {
      // pokud jsem pretekl, vynuluju mocniny
      for (int i=0; i<=expIndex; i++) {
	  powers[i] = 0;
      }
      
    }
}
*/


void genPrimes(long long result, int primeIndex) {
    while (result <= upperBound) {
        if (result >= lowerBound) {
	    compounds.insert(result);
	}
	if (primeIndex < n-1) {
	    genPrimes(result, primeIndex+1);
	}
	result *= primes[primeIndex];
    }
}


int main(void){
  /*
    cout << makeCompound() << endl;
    primes[0] = 2;
    primes[1] = 3;
    primes[2] = 5;
    n = 3;
    powers[1] = 1;
    powers[2] = 2;
    cout << makeCompound() << endl;
    return 0;
  */
    while (cin >> n && n > 0) {
        for (int i=0; i<n; i++) {
	  cin >> primes[i];
	  powers[i] = 0;
	}
	cin >> lowerBound >> upperBound;
	compounds.clear();
	// mame vstup
	
	genPrimes(1, 0);
	//sort(compounds.begin(), compounds.end());
	if (compounds.empty()) {
	  cout << "none" << endl;
	}
	else {
	  set<int>::iterator i = compounds.begin();
	  cout << *i;
	  ++i;
	  for ( ; i != compounds.end(); ++i) {
	      cout << "," << *i;
	  }
	  cout << endl;
	}
    }
  
    return 0;
}