CF 464 DIV2C

C. Convenient For Everybody

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In distant future on Earth day lasts for n hours and that's why there are n timezones. Local times in adjacent timezones differ by one hour. For describing local time, hours numbers from 1 to n are used, i.e. there is no time "0 hours", instead of it "n hours" is used. When local time in the 1-st timezone is 1 hour, local time in the i-th timezone is i hours.

Some online programming contests platform wants to conduct a contest that lasts for an hour in such a way that its beginning coincides with beginning of some hour (in all time zones). The platform knows, that there are a_i people from i-th timezone who want to participate in the contest. Each person will participate if and only if the contest starts no earlier than s hours 00 minutes local time and ends not later than f hours 00 minutes local time. Values s and f are equal for all time zones. If the contest starts at f hours 00 minutes local time, the person won't participate in it.

Help platform select such an hour, that the number of people who will participate in the contest is maximum.

Input

The first line contains a single integer n (2 ≤ n ≤ 100 000) — the number of hours in day.

The second line contains n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10 000), where a_i is the number of people in the i-th timezone who want to participate in the contest.

The third line contains two space-separated integers s and f (1 ≤ s < f ≤ n).

Output

Output a single integer — the time of the beginning of the contest (in the first timezone local time), such that the number of participants will be maximum possible. If there are many answers, output the smallest among them.

Examples

Input

Copy

3
1 2 3
1 3

Output

3

Input

Copy

5
1 2 3 4 1
1 3

Output

4

Note

In the first example, it's optimal to start competition at 3 hours (in first timezone). In this case, it will be 1 hour in the second timezone and 2 hours in the third timezone. Only one person from the first timezone won't participate.

In second example only people from the third and the fourth timezones will participate.

题意:

若地区时间为1,则第i个地区的时间为i,现在要举行一场比赛,时间为1小时,已知每个地区想参加这场比赛的人数,若比赛时间是当地时间的s到f之间,则可以该地区可以参加这场比赛,问最多有多少人可以参加这场比赛.

题解:

很明显我们可以枚举每一个地区为开始点s可以有多少个赛区参加(前缀和),这里有一个坑,如果比赛在f开始,这个赛区是无法参加的.

code:

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define LL long long

using namespace std;

LL sum[100010];

int main(void)
{
    int n,i,j;
    while(scanf("%d",&n)==1)
    {
        sum[0] = 0;
        for(i=1;i<=n;i++)
        {
            int x;
            scanf("%d",&x);
            sum[i] = sum[i-1] + x;
        }
        int s,f;
        scanf("%d%d",&s,&f);
        int t = f-s;
        LL maxn = 0;
        int ans = n;
        for(i=1;i<=n-t+1;i++)
        {
            LL tmp = sum[i+t-1] - sum[i-1];
            if(tmp > maxn)
            {
                maxn = tmp;
                ans = s - i + 1;
                if(ans <= 0)
                    ans += n;
            }
            else if(tmp == maxn)
            {
                int ta = s-i+1;
                if(ta <= 0)
                    ta += n;
                if(ta < ans)
                    ans = ta;
            }
        }
        for(;i<=n;i++)
        {
            LL tmp = sum[n] - sum[i-1] + sum[t-n+i-1];
            if(tmp > maxn)
            {
                maxn = tmp;
                ans = s - i + 1;
                if(ans <= 0)
                    ans += n;
            }
            else if(tmp == maxn)
            {
                int ta = s-i+1;
                if(ta <= 0)
                    ta += n;
                if(ta < ans)
                    ans = ta;
            }
        }

        printf("%d\n",ans);
    }


    return 0;
}