#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
    int maxSumTwoNoOverlap(vector<int>& nums, int firstLen, int secondLen) {
        ///Senerio1
        int ans1=0;
        int i=0,j=firstLen-1,a=firstLen,b=a+secondLen-1;
        for(int i=1;i<nums.size();i++){
            nums[i]+=nums[i-1];
        }
        int s1=nums[j],max1=nums[j];
        int s2=nums[b]-nums[a-1];
        while(b<nums.size()){
            max1=max(s1,max1);
            ans1=max(ans1,max1+s2);
            j++;b++;if(b<nums.size()){
                s1=nums[j];s2=nums[b];
            }
            s1-=nums[i];s2-=nums[a];
            i++;a++;
        }

        ///Senerio2
        int ans2=0;
        i=0;j=secondLen-1;a=secondLen;b=a+firstLen-1;
         s1=nums[j],max1=nums[j];
         s2=nums[b]-nums[a-1];
        while(b<nums.size()){
            max1=max(s1,max1);
            ans2=max(ans2,max1+s2);
            j++;b++;if(b<nums.size()){
                s1=nums[j];s2=nums[b];
            }
            s1-=nums[i];s2-=nums[a];
            i++;a++;
        }
        return max(ans1,ans2);

    }
};
int main() {
	// your code goes here
	Solution x;
	int n;cin>>n;
	vector<int>v(n);
	for(int i=0;i<n;i++)cin>>v[i];
	int a,b;cin>>a>>b;
	cout<<x.maxSumTwoNoOverlap(v,a,b)<<endl;
	return 0;
}