#include <iostream>
#include <fstream>
#include <deque>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define fact 10000
#define ll long long
using namespace std;
ifstream f("secv3.in");
ofstream g("secv3.out");

deque <int> q;
int n,l,u,mxi,mxj; ll a[30005],b[30005];
ll s[30005];
int Ans(int r)
{ int i; ll sol,vmin;
  for(i=1;i<=n;i++)
   s[i]=(ll) s[i-1]+a[i]-1LL*b[i]*r;

   q.clear();
  for(i=1;i<=n;i++)
  {
     if (i-l>=0)
      { while(!q.empty() && s[i-l]<=s[q.back()])
         q.pop_back();

        q.push_back(i-l);

      }

      while(!q.empty() && q.front()<=i-u-1)
       q.pop_front();

    if (!q.empty())
    {vmin=s[q.front()];
     sol=s[i]-vmin;
     if (sol>=0) return 1;
    }

  }

  return 0;
}

void Search()
{ int st=0,dr=30005*fact,mid;
   while(st<=dr)
   { mid=(st+dr)/2;
      if (Ans(mid)) st=mid+1; else dr=mid-1;
   }
   mid=(st+dr)/2;
   if (!Ans(mid)) mid--;

   Ans(mid);

   g<<fixed<<setprecision(4)<<(double)mid/fact<<"\n";
}
int main()
{ int i,j,t;
    f>>n>>l>>u;


    for(i=1;i<=n;i++)
     {f>>a[i];
      a[i]*=fact;
     }

    for(i=1;i<=n;i++)
      f>>b[i];

   Search();

  return 0;
}