#include #include int prv[100]; int pole[2000000]; int pos[100]; int main() { while(1) { int N; scanf("%d", &N); if (N == 0) { break; } for (int i = 0; i < N; i++) scanf("%d", &prv[i]); int a,b; scanf("%d %d", &a, &b); for (int i = 0; i < N; i++) pos[i] = 1; int last = 1; pole[1] = 1; int first = 1; if (a <= 1) { printf("1"); first = 0; } while (pole[last] <= b) { for (int i = 0; i < N; i++) { while (pole[pos[i]]*prv[i] <= pole[last]) pos[i]++; } int min = INT_MAX; for (int i = 0; i < N; i++) { if (pole[pos[i]]*prv[i] < min) min = pole[pos[i]]*prv[i]; } pole[++last] = min; if (pole[last] >= a && pole[last] <= b) { if (!first) { printf(","); } if (first) first = 0; printf("%d", pole[last]); } } if (first) printf("none\n"); else printf("\n"); } return 0; }