#include<cstdio>

int main() {
	while (1) {
		int m, nmin, nmax, p[201], maxg = 0, n;
		scanf("%d %d %d", &m, &nmin, &nmax);
		for (int i = 1; i <= m; i++) {
			scanf("%d", &p[i]);
		}
		for (int j = nmin; j <= nmax; j++) {
			if (p[j] - p[j+1] >= maxg) {
				maxg = p[j] - p[j+1];
				n = j;
			}
		}
		if (m == 0 && nmin == 0 && nmax == 0) {
			return 0;
		}
		else {
			printf("%d\n", n);
		}
	}
}

#include <stdio.h>

char buf[100];
int l[10], v[2];

int main() {
	while (scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d", l, l + 1, l + 2, l + 3, l + 4, l + 5, l + 6, l + 7, l + 8, l + 9, v, v + 1) != -1) {
		int total = 0;
		int i;
		
		for (i = 0; i < 10; i++) total += l[i];
		
		int now = 0;
		for (i = 0; i < 10; i++) {
			now += l[i];
			if (now * v[1] >= (total - now) * v[0]) {
				break;
			}
		}
		printf("%d\n", i + 1);
	}
	return 0;
}