main

int main() {

	int n,l,r;
	cin>>n>>l>>r;

	node *root;
	root=new node;
	node *trav=root;
	for (int i=0 ; i<n ; i++) {
		int x;
		cin>>x;

		trav->val=x;
		if(i!=n-1)	trav->next=new node;
		else	 trav->next=NULL;
		trav=trav->next;
	}

	trav=Solve(root,l,r);

	while (trav!=NULL) {
		cout<<trav->val<<" ";
		trav=trav->next;
	}
	cout<<endl;
	
}