#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=3.1e5;
inline LL read(){
	LL x=0,ff=1;
	char c=getchar();
	while(!isdigit(c)&&c!='-') c=getchar();
	if(c=='-') ff=-1,c=getchar();
	while(isdigit(c)) x=x*10+c-'0',c=getchar();
	return x*ff;
}
inline void output(LL x){
	if(!x) return ;
	output(x/10ll);
	putchar(x%10ll+'0');
}
inline void write(LL x){
	if(x==0){
		puts("0");
		return ;
	}
	if(x<0) putchar('-'),x=-x;
	output(x);
	putchar(' ');
}
int n;
int a[N];
int pre[N],nxt[N],st[N],top;
LL calc(LL i,LL len){
	if(len==0) return 0;
	LL posl=i-pre[i]+1,posr=nxt[i]-i+1;
	LL res=0;
	if(posl<=posr){
		if(len<=posl)
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+len-1) - (i) + 1 ))*len/2;
		else if(len<=posr)
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+posl-1) - (i) + 1 ))*posl/2+
				( ( (i+(posl+1)-1) - (pre[i]+(posl+1)-1) + 1 ) + ( (i+len-1) - (pre[i]+len-1) + 1 ))*(len-posl)/2;
		else
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+posl-1) - (i) + 1 ))*posl/2+
				( ( (i+(posl+1)-1) - (pre[i]+(posl+1)-1) + 1 ) + ( (i+posr-1) - (pre[i]+posr-1) + 1 ))*(posr-posl)/2+
				( ( (nxt[i]) - (pre[i]+(posr+1)-1) + 1 ) + ( (nxt[i]) - (pre[i]+len-1) + 1 ) )*(len-posr)/2;
	}
	else{
		if(len<=posr)
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+len-1) - (i) + 1 ))*len/2;
		else if(len<=posl)
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+posr-1) - (i) + 1 ))*posr/2+
				( ( (nxt[i]) - (i) + 1 ) + ( (nxt[i]) - (i) + 1 ) )*(len-posr)/2;
		else
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+posr-1) - (i) + 1 ))*posr/2+
				( ( (nxt[i]) - (i) + 1 ) + ( (nxt[i]) - (i) + 1 ) )*(posl-posr)/2+
				( ( (nxt[i]) - (pre[i]+(posl+1)-1) + 1 ) + ( (nxt[i]) - (pre[i]+len-1) + 1 ) )*(len-posl)/2;
	}
	return res;
}
bool check(LL mid,LL rk){
	LL res=0;
	for(int i=1;i<=n;++i){
		res+=calc(i,min(mid/a[i],nxt[i]-pre[i]+1ll));
		if(res>=rk)
			return 1;
	}
	return 0;
}
LL getrk(LL x){
	LL res=0;
	for(int i=1;i<=n;++i)
		res+=calc(i,min(x/a[i],nxt[i]-pre[i]+1ll));
	return res;
}
#define pii pair<LL,int>
#define mk make_pair
priority_queue<pii> pq;
int main(){
	LL L,R,cnt;
	n=read();
	for(int i=1;i<=n;++i)
		a[i]=read();
	L=read();R=read();
	cnt=R-L+1;
	st[++top]=0;
	for(int i=1;i<=n;++i){
		while(top&&a[st[top]]>=a[i]) nxt[st[top--]]=i;
		pre[i]=st[top];
		st[++top]=i;
	}
	while(top>1) nxt[st[top--]]=n+1;
	for(int i=1;i<=n;++i)
		++pre[i],--nxt[i];
	LL l=0,r=3e14,st=-1;
	while(l<=r){
		LL mid=(l+r)>>1;
		if(check(mid,L))
			st=mid,r=mid-1;
		else
			l=mid+1;
	}
	LL rk_st=getrk(st);
	for(int i=1;i<=rk_st-L+1&&cnt;++i)
		write(st),--cnt;
	for(int i=1;i<=n;++i)
		if(st/a[i]+1<=nxt[i]-pre[i]+1ll){
			pq.push(mk(-(st/a[i]+1)*a[i],i));
		}
	while(!pq.empty()&&cnt){
		LL now=-pq.top().first;
		int x=pq.top().second; pq.pop();
		LL len=now/a[x];
		LL num=calc(x,len)-calc(x,len-1);
		for(int i=1;i<=num&&cnt;++i)
			write(now),--cnt;
		if(len+1<=nxt[x]-pre[x]+1ll)
			pq.push(mk(-(len+1)*a[x],x));
	}
}
/*#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=3.1e5;
inline LL read(){
	LL x=0,ff=1;
	char c=getchar();
	while(!isdigit(c)&&c!='-') c=getchar();
	if(c=='-') ff=-1,c=getchar();
	while(isdigit(c)) x=x*10+c-'0',c=getchar();
	return x*ff;
}
inline void output(LL x){
	if(!x) return ;
	output(x/10ll);
	putchar(x%10ll+'0');
}
inline void write(LL x){
	if(x==0){
		puts("0");
		return ;
	}
	if(x<0) putchar('-'),x=-x;
	output(x);
	putchar(' ');
}
int n;
int a[N];
int pre[N],nxt[N],st[N],top;
LL calc(LL i,LL len){
	if(len==0) return 0;
	LL posl=i-pre[i]+1,posr=nxt[i]-i+1;
	LL res=0;
	if(posl<=posr){
		if(len<=posl)
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+len-1) - (i) + 1 ))*len/2;
		else if(len<=posr)
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+posl-1) - (i) + 1 ))*posl/2+
				( ( (i+(posl+1)-1) - (pre[i]+(posl+1)-1) + 1 ) + ( (i+len-1) - (pre[i]+len-1) + 1 ))*(len-posl)/2;
		else
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+posl-1) - (i) + 1 ))*posl/2+
				( ( (i+(posl+1)-1) - (pre[i]+(posl+1)-1) + 1 ) + ( (i+posr-1) - (pre[i]+posr-1) + 1 ))*(posr-posl)/2+
				( ( (nxt[i]) - (pre[i]+(posr+1)-1) + 1 ) + ( (nxt[i]) - (pre[i]+len-1) + 1 ) )*(len-posr)/2;
	}
	else{
		if(len<=posr)
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+len-1) - (i) + 1 ))*len/2;
		else if(len<=posl)
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+posr-1) - (i) + 1 ))*posr/2+
				( ( (nxt[i]) - (i) + 1 ) + ( (nxt[i]) - (i) + 1 ) )*(len-posr)/2;
		else
			res=( ( (i+1-1) - (i) + 1 ) + ( (i+posr-1) - (i) + 1 ))*posr/2+
				( ( (nxt[i]) - (i) + 1 ) + ( (nxt[i]) - (i) + 1 ) )*(posl-posr)/2+
				( ( (nxt[i]) - (pre[i]+(posl+1)-1) + 1 ) + ( (nxt[i]) - (pre[i]+len-1) + 1 ) )*(len-posl)/2;
	}
	return res;
}
bool check(LL mid,LL rk){
	LL res=0;
	for(int i=1;i<=n;++i){
		res+=calc(i,min(mid/a[i],nxt[i]-pre[i]+1ll));
		if(res>=rk)
			return 1;
	}
	return 0;
}
LL getrk(LL x){
	LL res=0;
	for(int i=1;i<=n;++i)
		res+=calc(i,min(x/a[i],nxt[i]-pre[i]+1ll));
	return res;
}
#define pii pair<LL,int>
#define mk make_pair
priority_queue<pii> pq;
int main(){
	LL L,R,cnt;
	n=read();
	for(int i=1;i<=n;++i)
		a[i]=read();
	L=read();R=read();
	cnt=R-L+1;
	st[++top]=0;
	for(int i=1;i<=n;++i){
		while(top&&a[st[top]]>=a[i]) nxt[st[top--]]=i;
		pre[i]=st[top];
		st[++top]=i;
	}
	while(top>1) nxt[st[top--]]=n+1;
	}
}*/