#include <bits/stdc++.h>
using namespace std;
class input {
private:
FILE* fin;
const int sz = 10000;
char* buff, c;
int p;
const char stop = char(-51);
char read()
{
if (p == sz)
{
fread(buff, 1, sz, fin);
p = 0;
return buff[p++];
}
else
return buff[p++];
}
bool digit(char c)
{
return c >= '0' && c <= '9';
}
public:
input(const char* name)
{
c = '-';
buff = new char[sz];
p = 0;
fin = fopen(name, "r");
fread(buff, 1, sz, fin);
}
void close()
{
fclose(fin);
}
void open(const char* name)
{
c = '-';
p = sz;
fin = fopen(name, "r");
}
bool eof()
{
int i = p;
while (true)
{
while (i < sz && (buff[i] == ' ' || buff[i] == '\n'))
i++;
if (i != sz)
{
if (buff[i] == stop)
return 1;
return 0;
}
else
{
fread(buff, 1, sz, fin);
p = 0;
i = 0;
}
}
}
input& operator >> (int& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = 0;
int sng = 1;
if (c == '-')
sng = -1, c = read();
while (digit(c))
n = n * 10 + (c - '0'), c = read();
n *= sng;
return *this;
}
input& operator >> (long long& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = 0;
int sng = 1;
if (c == '-')
sng = -1, c = read();
while (digit(c))
n = n * 10 + (c - '0'), c = read();
n *= sng;
return *this;
}
input& operator >> (unsigned long long& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = 0;
int sng = 1;
if (c == '-')
sng = -1, c = read();
while (digit(c))
n = n * 10 + (c - '0'), c = read();
n *= sng;
return *this;
}
input& operator >> (char& ch)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
ch = c;
return *this;
}
input& operator >> (string& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = "";
while (c != ' ' && c != '\n' && c != '\0')
n += c, c = read();
return *this;
}
input& operator >> (double& n)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
n = 0;
while (digit(c))
n = n * 10 + (c - '0'), c = read();
if (c != '.')
return *this;
c = read();
double p10 = 10;
while (digit(c))
n = n + double(c - '0') / p10, c = read(), p10 *= 10;
return *this;
}
input& operator >> (char* s)
{
c = read();
while (c == ' ' || c == '\n')
c = read();
while (c != ' ' && c != '\n')
*s = c, s++, c = read();
*s = '\0';
return *this;
}
void getline(string& s)
{
s = "";
c = read();
while (c == ' ')
c = read();
while (c != '\n')
s += c, c = read();
}
};
class output {
private:
FILE* fout;
const int sz = 10000;
char* buff;
int p;
void write(char ch)
{
if (p == sz)
{
fwrite(buff, 1, sz, fout);
p = 0;
buff[p++] = ch;
}
else
buff[p++] = ch;
}
public:
output(const char* name)
{
buff = new char[sz];
p = 0;
fout = fopen(name, "w");
}
~output()
{
fwrite(buff, 1, p, fout);
}
output& operator << (int n)
{
if (n < 0)
write('-'), n *= -1;
if (n == 0)
{
write(n + '0');
return *this;
}
if (n / 10 != 0)
*this << (n / 10);
write(('0' + (n % 10)));
return *this;
}
output& operator << (long long n)
{
if (n < 0)
{
write('-');
n *= -1;
}
if (n < 10)
{
write(n + '0');
return *this;
}
*this << (n / 10);
write((n % 10) + '0');
return *this;
}
output& operator << (unsigned long long n)
{
if (n < 0)
{
write('-');
n *= -1;
}
if (n < 10)
{
write(n + '0');
return *this;
}
*this << (n / 10);
write((n % 10) + '0');
return *this;
}
output& operator << (char c)
{
write(c);
return *this;
}
void precision(double n, int x)
{
*this << int(n);
if (!x)
return;
write('.');
n -= int(n);
n *= 10;
for (int i = 1; i <= x; i++)
{
*this << int(n);
n -= int(n);
n *= 10;
}
}
output& operator << (string n)
{
for (auto i : n)
write(i);
return *this;
}
};
ifstream fin("secv3.in");
ofstream fout("secv3.out");
int n, a[30001], b[30001], l, u;
struct nod {
int s, t, poz;
bool operator < (nod& aux)
{
if (s - t < aux.s - aux.t)
return 1;
else if (s - t == aux.s - aux.t && s < aux.s)
return 1;
return 0;
}
};
int main()
{
fin >> n >> u >> l;
for (int i = 1; i <= n; i++)
fin >> a[i], a[i] += a[i - 1];
for (int i = 1; i <= n; i++)
fin >> b[i], b[i] += b[i - 1];
deque <nod> d;
d.push_back({ 0, 0, 0});
nod add;
for (int i = 1; i < l; i++)
{
add = { a[i], b[i], i};
while (d.size() && add < d.back())
d.pop_back();
d.push_back(add);
}
double maxi = 0;
for (int i = l; i <= n; i++)
{
maxi = max(maxi, double(a[i] - d.front().s) / (b[i] - d.front().t));
add = { a[i], b[i], i};
while (d.size() && add < d.back())
d.pop_back();
d.push_back(add);
while (d.front().poz < i - u)
d.pop_front();
}
fout << maxi;
return 0;
}