#include <bits/stdc++.h>

using namespace std;
ifstream in("secv3.in");
ofstream out("secv3.out");
int n, l, u;
double long sc[30005], st[30005], x, k, Max=0;
deque<pair<double long,int>> q;
int main()
{
    in>>n>>l>>u;
    for(int i = 1; i <= n; i++)
    {
        in>>x;
        sc[i] = sc[i - 1] + x;
    }
    for(int i = 1; i <= n; i++)
    {
        in>>x;
        st[i] = st[i - 1] + x;
    }

    for (int i = l ; i <= u; i++) {
        for (int j = 1; j <= n - i + 1; j++) {
            Max = max(Max, (sc[j + i - 1] - sc[j - 1]) / (st[j + i - 1] - st[j - 1]));
        }
    }
    out<<fixed<<setprecision(2)<<Max;
    return 0;
}