#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<climits>
#include<string.h>
using namespace std;

int main(){
    int m,n1,n2;
    while(cin>>m>>n1>>n2,m){
        int p[202];
        vector<pair<int,int> >v;
        for(int i=1;i<=m;i++){
            cin>>p[i];
            if(i-1>=n1&&i-1<=n2){
                v.push_back(make_pair(p[i-1]-p[i],i-1));
            }
        }
        sort(v.begin(),v.end());
        cout<<v[v.size()-1].second<<endl;
    }
}
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

int main()
{
    for(;;){
        char c;
        vector<int> len(10);
        for(int i=0; i<10; ++i){
            if(!(cin >> len[i] >> c))
                return 0;
        }
        int v1, v2;
        cin >> v1 >> c >> v2;

        int sumLen = accumulate(len.begin(), len.end(), 0);
        int tmp = 0;
        for(int i=0; i<10; ++i){
            tmp += len[i];
            if(sumLen * v1 <= tmp * (v1 + v2)){
                cout << (i+1) << endl;
                break;
            }
        }
    }
}