#include <iostream>
#include<bits/stdc++.h>
 
using namespace std;
 
int main() {
	// your code goes here
	int n,l,r;
	cin>>n>>l>>r;
	vector<int> arr(n);
	unordered_map<int,int> mpp;
 
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	int a = r-l+1;
	int i=0;
	int j=0;
	int ans = INT_MAX;
 
	while(i<n && j<n){
	   if(arr[j]>=l && arr[j]<=r){
			mpp[arr[j]]++;
		}
 
		while(mpp.size()==a){
			ans = min(ans,j-i+1);
		if(arr[i]>=l && arr[i]<=r){
			mpp[arr[i]]--;
			if(mpp[arr[i]]==0){
				mpp.erase(arr[i]);
			}
		}
			i++;
		}
 
		j++;
	}
	cout<<ans<<endl;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG4sbCxyOwoJY2luPj5uPj5sPj5yOwoJdmVjdG9yPGludD4gYXJyKG4pOwoJdW5vcmRlcmVkX21hcDxpbnQsaW50PiBtcHA7CgoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJY2luPj5hcnJbaV07Cgl9CglpbnQgYSA9IHItbCsxOwoJaW50IGk9MDsKCWludCBqPTA7CglpbnQgYW5zID0gSU5UX01BWDsKCQoJd2hpbGUoaTxuICYmIGo8bil7CgkgICBpZihhcnJbal0+PWwgJiYgYXJyW2pdPD1yKXsKCQkJbXBwW2FycltqXV0rKzsKCQl9CgkJCgkJd2hpbGUobXBwLnNpemUoKT09YSl7CgkJCWFucyA9IG1pbihhbnMsai1pKzEpOwoJCWlmKGFycltpXT49bCAmJiBhcnJbaV08PXIpewoJCQltcHBbYXJyW2ldXS0tOwoJCQlpZihtcHBbYXJyW2ldXT09MCl7CgkJCQltcHAuZXJhc2UoYXJyW2ldKTsKCQkJfQoJCX0KCQkJaSsrOwoJCX0KCQkKCQlqKys7Cgl9Cgljb3V0PDxhbnM8PGVuZGw7CglyZXR1cm4gMDsKfQ==

OCAyIDQKMiAxIDQgMyAyIDEgMSA0

8 2 4
2 1 4 3 2 1 1 4