#include <map>#include <queue>#include <cstdio>#include <cstdlib>#include <ctime>#include <cassert>#include <cstring>#include <iostream>#include <algorithm>using namespace std;#define mp make_pairtypedef unsigned long long UL;typedef map<UL,int> MI;typedef MI::iterator IT;const int N = 1e5 + 10;MI M;pair<int, UL> all[N<<2];UL p[N];UL sum[N<<2];void debug(int cnt){ for(int i=1;i<=cnt;++i) cout << all[i].first << ' ' << all[i].second << endl;}int main(){ int n, i; UL L,R,ca,cb; while(~scanf("%d",&n)){ scanf("%llu%llu",&L,&R); scanf("%llu%llu",&ca,&cb); cb = ca - cb; M.clear(); for(i=0;i<n;++i){ scanf("%llu",&p[i]); M[p[i]]++; M[p[i]+cb]--; } if(!cb){ puts("0"); continue; } IT e = M.begin(); int val = 0, cnt = 0; UL last = L+cb-1; for(;e!=M.end()&&L+cb>=e->first+1;++e) val += e->second; for(; e != M.end() && e->first<=R; ++e){ all[++cnt] = mp(val,e->first-last); val += e->second; last = e->first; } all[++cnt] = mp(val,R-last+1); sum[0] = 0; for(i=1;i<=cnt;++i){ sum[i] = sum[i-1] + all[i].second; } assert(L+cb+sum[cnt]==R+2); UL sz = ca-cb+1; deque<int> q; int ans = 0; for(i=1;i<=cnt;++i){ if(sum[i]<sz){ while(!q.empty() && all[i].first<=all[q.back()].first) q.pop_back(); q.push_back(i); continue; } while(!q.empty() && all[i].first<=all[q.back()].first) q.pop_back(); q.push_back(i); while(!q.empty() && sum[i]>=sum[q.front()]+sz) q.pop_front(); if(!q.empty() && all[q.front()].first > ans) ans = all[q.front()].first; } printf("%dn",ans); } return 0;}
