Welcome to ZOJ
121 - The 2012 ACM-ICPC Asia Changchun Regional Contest - A
Alice and Bob

Time Limit: 3 Seconds      Memory Limit: 32768 KB

These days, Alice came up with a new game. In this game, there are some balls placed in a line which are numbered from L to R from left to right. It is known that N of the balls are white, while others are black. Alice will select aCount consecutive balls, after that, Bob will remove bCount balls from the balls that Alice has selected. Bob could remove those bCount balls one by one, for each ball he removes, he can choose whether to select the left most one or right most one.

The goal of Alice is to maximize the number of white balls after Bob's operation, and Bob's goal is to minimize this number.

So, what is the maximum number of white balls after Bob's operation?


There are multiple test cases, for each case:
The first line is an integer N. (1 ≤ N ≤ 100,000)
The second line contains two integers L, R. (0 ≤ L ≤ R ≤ 263 - 1)
The third line contains two integers aCount, bCount.
The fourth line contains N integers p[0], p[1], ..., p[N - 1], denoting the positions of the white balls.

It is guaranteed that p[i - 1] < p[i] (1 ≤ i ≤ N - 1), L ≤ p[0], p[N - 1] ≤ R, 0 ≤ aCount ≤ R - L + 1, 0≤bCountaCount.


For each test case, output one line representing the maximum number.

Sample Input

5 9
3 1
5 8
6 10
5 0
6 8

Sample Output


Submit    Status