#include <fstream>
#include <iomanip>
#include <deque>
#define int long long
using namespace std;

ifstream cin("secv3.in");
ofstream cout("secv3.out");

double v[30005];
double d[30005];

deque <int> dq;

signed main()
{
    double mx=0, a, sus=0, jos=0;
    int n, l, r, cnt=0, poz=0, k;
    cin>>n>>l>>r;
    for(int i=1; i<=n; i++)
    {
        cin>>v[i];
        v[i]+=v[i-1];
    }
    for(int i=1; i<=n; i++)
    {
        cin>>d[i];
        a=(sus+(v[i]-v[i-1]))/(d[i]+jos);
        d[i]+=d[i-1];
        if(a>=1 && a>mx)
        {
            poz++;
            sus+=(v[i]-v[i-1]);
            jos+=(d[i]-d[i-1]);
            mx=a;
        }
        else
        {
            cnt=max(cnt, poz);
            poz=0;
            mx=0;
            jos=sus=0;
        }
    }
    cnt=max(cnt, poz);
    poz=0;
    mx=0;
    if(l<=cnt && cnt<=r)
    {
        k=cnt;
    }
    else if(cnt<l)
    {
        k=l;
    }
    else
    {
        k=r;
    }
    mx=max(mx, v[k]/d[k]);
    for(int i=k; i<=n; i++)
    {
        while(!dq.empty() && dq.front()<=i-k)
        {
            dq.pop_front();
        }
        while(!dq.empty() && (v[dq.back()]-v[dq.front()-k])/(d[dq.back()]-d[dq.front()-k])<(v[i]-v[i-k])/(d[i]-d[i-k]))
        {
            dq.pop_back();
        }
        dq.push_back(i);
        mx=max(mx, (v[dq.back()]-v[dq.front()-k])/(d[dq.back()]-d[dq.front()-k]));
    }
    cout<<fixed<<setprecision(2)<<mx;

    return 0;
}