#include <vector>
#include <algorithm>
#include <cmath>
#include <fstream>
#define FOR(i,x) for (i=1;i<=x;++i)

using namespace std;

ifstream f("secv3.in");
ofstream g("secv3.out");

int st,dr,N,i,Sc,St,Mx,C[30001],T[30001];

void solve1()
{
    int Cost=0,Time=0;
    for (int i=1;i<=N;i++)
       for (int j=i;j<=min(i+(dr-st),N);j++)
          {
              Cost=C[j]-C[i-1];
              Time=T[j]-C[i-1];

              if (Cost/Time>Mx) Mx=Cost/Time;
          }
    g<<Mx/100<<"."<<Mx%100/10<<Mx%10<<'\n';
}

void solve2()
{
    for (int i=st;i<=N;++i)
        {
            Sc+=C[i]-C[i-st];
            St+=T[i]-T[i-st];

            if (Sc/St>Mx) Mx=Sc/St;
        }

    g<<Mx/100<<"."<<Mx%100/10<<Mx%10<<'\n';
}

int main()
{
    f>>N>>st>>dr;

    FOR(i,N) f>>C[i],C[i]=C[i]*100;

    FOR(i,N) f>>T[i];

    FOR(i,st-1) Sc+=C[i],St+=T[i];

    if (N<6000) solve1();
       else solve2();

    f.close();
    g.close();
    return 0;
}