#include <fstream>
#include <deque>
using namespace std;

ifstream cin("secv3.in");
ofstream cout("secv3.out");
const int N = 30000;
double c[N + 1], t[N + 1], v[N + 1];
int main()
{
    int i, n, l, u, pasi, ok, st, dr;
    double mij, x;
    cin >> n >> l >> u;
    for(i = 1; i <= n; i++)
    {
        cin >> x;
        c[i] = c[i - 1] + x;
    }
    for(i = 1; i <= n; i++)
    {
        cin >> x;
        t[i] = t[i - 1] + x;
    }
    st = 0;
    dr = 30000000;
    deque <int> dq;
    for(pasi = 0; pasi < 60; pasi++)
    {
        mij = (st + dr ) / 2;
        for(i = 1; i <= n; i++)
        {
            v[i] = c[i] / (t[i] * mij);
        }
        ok = 0;
        for(i = l; i <= n; i++)
        {
            while(!dq.empty() && v[dq.back()] > v[i - l])
            {
                dq.pop_back();
            }
            dq.push_back(i - l);
            if(dq.front() < i - u)
                dq.pop_front();
            if(v[i] >= v[dq.front()])
            {
                ok = 1;
                //printf("%f %f %f\n",v[i], v[dq.front()], mij);
            }
        }
        if(ok == 1)
        {
            x = mij;
            st = mij + 1;
        }
        else
            dr = mij - 1;
    }
    cout << x;
    return 0;
}