#include <fstream>
#include <deque>

using namespace std;

deque <int> dq;

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

double p[30005];
double t[30005];
int n, l, u, i;
double sol;

int main()
{
    double max= 0;
    cin>>n>>l>>u;
    for(i=1;i<=n;++i)
        {
            cin >> p[i];
            p[i]+=p[i-1];
        }
    for(i=1;i<=n;++i)
        {
            cin>>t[i];
            t[i]+=t[i-1];
        }
    for(int i = 1 ; i <= n-l+1 ; ++ i )
        for(int j = i+l-1 ; j <= n && j<=i+u-1 && j <= i+l+1000 ; ++j)
            if(p[j] - p[i-1] > max*(t[j] - t[i-1]))
                max = ( p[j] - p[i-1] ) / ( t[j] - t[i-1] );

    cout<<max<<"\n";
    cin.close();
    cout.close();
    return 0;
}