#include<bits/stdc++.h>
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int n,q,ql,qr;
char s[3000005];
int l[300005],r[300005];
int c[300005];
void modify(int x,int d){while(x<=300004){c[x]+=d,x+=x&(-x);}}
int query(int x){
	int res=0;
	while(x)res+=c[x],x-=x&(-x);
	return res;
}
int ans[6000005];
int w[6000005];
int rl;
signed main(){
	q=read();
	scanf("%s",s+1);n=strlen(s+1);
	for(int i=1;i<=q;i++)l[i]=read(),r[i]=read();
	bool ok=1,ok2=1;
	int len=n;
	for(int i=1;i<=q;i++)ok&=(l[i]==r[i]),ok2&=(r[i]==len),len+=r[i]-l[i]+1;
	reverse(l+1,l+q+1),reverse(r+1,r+q+1);
	ql=read(),qr=read();
	if(ok){
		for(int i=1;i<=qr;i++)modify(i,1);
		for(int i=1;i<=q;i++){
			int pl=1,pr=qr;
			int res=-1;
			while(pl<=pr){
				int mid=(pl+pr)/2;
				if(query(mid)>=r[i]+1)res=mid,pr=mid-1;
				else pl=mid+1;
			}
			if(res!=-1)modify(res,-1),modify(qr+1,1);
		}
		for(int i=ql;i<=qr;i++){
			putchar(s[query(i)]);
		}
		return 0;
	}
	if(ok2){
		//puts("Q");
		for(int i=1;i<=n;i++)ans[i]=i;
		reverse(l+1,l+q+1);
		reverse(r+1,r+q+1);
		int cur=n;
		for(int i=1;i<=q;i++){
			if(cur>qr)break;
			rl=0;
			for(int j=l[i]+1;j<=r[i];j+=2)w[++rl]=ans[j];
			for(int j=l[i];j<=r[i];j+=2)w[++rl]=ans[j];
			for(int j=1;j<=rl;j++)ans[++cur]=w[j];
		}
		for(int i=ql;i<=qr;i++)putchar(s[ans[i]]);
		return 0;
	}
	//r[i]=len[i].
	//
	for(int i=ql;i<=qr;i++){
		int x=i;
		for(int j=1;j<=q;j++){
			if(x>=r[j]+1+r[j]-l[j]+1){
				x-=(r[j]-l[j]+1);
			}
			else if(x>r[j]){
				int ev=(r[j]-l[j]+1)/2;
				if(x<=r[j]+ev){
					x=l[j]+2*(x-r[j])-1;
				}
				else{
					x=l[j]+2*(x-r[j]-ev-1);
				}
			}
		}
		putchar(s[x]);
	}
	return 0;
}
//look at my code
//my code is amazing