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

deque <ll> q;
int n,l,u,a[30005],b[30005];
ll s[30005];
int Ans(int r)
{ int i,vmin,sol=-2147000000;
  for(i=1;i<=n;i++)
   {s[i]=s[i-1]+a[i]-b[i]*r;
  // cout<<s[i]<<"\n";
   }
   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.back()<=i-u-1) q.pop_back();


     if (!q.empty())
    {vmin=s[q.back()];
     //cout<<i<<" "<<s[i]<<" "<<vmin<<"\n";
     sol=s[i]-vmin;
     if (sol>=0) return 1;
    }
  }

  return 0;
}

void Search()
{ int st=0,dr=3000005,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--;

   g<<fixed<<setprecision(2)<<(double)mid/100<<"\n";
}
int main()
{ int i;
    f>>n>>l>>u;

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

   Search();

  return 0;
}