At the beginning of the school year Berland State University starts two city school programming groups, for beginners and for intermediate coders. The children were tested in order to sort them into groups. According to the results, each student got some score from 1 to m points. We know that c_1 schoolchildren got 1 point, c_2 children got 2 points, ..., c_{m} children got m points. Now you need to set the passing rate k (integer from 1 to m): all schoolchildren who got less than k points go to the beginner group and those who get at strictly least k points go to the intermediate group. We know that if the size of a group is more than y, then the university won't find a room for them. We also know that if a group has less than x schoolchildren, then it is too small and there's no point in having classes with it. So, you need to split all schoolchildren into two groups so that the size of each group was from x to y, inclusive. 

Help the university pick the passing rate in a way that meets these requirements.


-----Input-----

The first line contains integer m (2 ≤ m ≤ 100). The second line contains m integers c_1, c_2, ..., c_{m}, separated by single spaces (0 ≤ c_{i} ≤ 100). The third line contains two space-separated integers x and y (1 ≤ x ≤ y ≤ 10000). At least one c_{i} is greater than 0.


-----Output-----

If it is impossible to pick a passing rate in a way that makes the size of each resulting groups at least x and at most y, print 0. Otherwise, print an integer from 1 to m — the passing rate you'd like to suggest. If there are multiple possible answers, print any of them.


-----Examples-----
Input
5
3 4 3 2 1
6 8

Output
3

Input
5
0 3 3 4 2
3 10

Output
4

Input
2
2 5
3 6

Output
0



-----Note-----

In the first sample the beginner group has 7 students, the intermediate group has 6 of them. 

In the second sample another correct answer is 3.

Difficulty: interview

Starter code:

Solutions:
m = int(input())
c = list(map(int,input().split()))
x, y = list(map(int,input().split()))

for i in range(m):
	sb = sum(c[:-i-1])
	si = sum(c[-i-1:])
	if x <= sb <= y:
		if x <= si <= y:
			print(m-i)
			break
else:
	print(0)


maximum = input()
m_int = list(map(int,input().split()))
size = list(map(int,input().split()))
x = size[0]
y = size[1]

beginner = []
intermediate = []
for i in range(len(m_int)):
    beginner.append(m_int[i])
    if sum(beginner) > y or sum(m_int[i+1:]) < x:
        del beginner[-1]
        break
    

for j in range(len(beginner),len(m_int)):
    intermediate.append(m_int[j])

if (sum(intermediate) < x or sum(intermediate) > y) or (sum(beginner) < x or sum(beginner) > y):
    passing_rate = 0
else:
    passing_rate = i+1
print(passing_rate)