#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
vector <int> a(1),b(1);
vector <int> heap;
int n,l,u,x,i;
float Max;
int main()
{
	freopen("secv3.in","r",stdin);
	freopen("secv3.out","w",stdout);
	scanf("%d%d%d",&n,&l,&u);
	heap.resize(u-l+2);
	for(i=0;i<n;i++)
	{
		scanf("%d",&x);
		a.push_back(a.back()+x);
	}
	for(i=0;i<n;i++)
	{
		scanf("%d",&x);
		b.push_back(b.back()+x);
	}
	for(i=l;i<=n;i++)
	{
		int in=max(i-u,0),i1=i-l+1;
		for(int j=in;j<i1;j++)
		{
			float s=(float)(a[i]-a[j])/(b[i]-b[j]);
			if(s>Max)
				Max=s;
		}
	}
	printf("%f\n",Max);
	return 0;
}