Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Startup Funding

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAn e-commerce startup pitches to the investors to get funding. They have been functional for *n* weeks now and also have a website!

For each week they know the number of unique visitors during this week *v* _{ i} and the revenue *c* _{ i}. To evaluate the potential of the startup at some range of weeks from *l* to *r* inclusive investors use the minimum among the maximum number of visitors multiplied by 100 and the minimum revenue during this period, that is:

The truth is that investors have no idea how to efficiently evaluate the startup, so they are going to pick some *k* random distinct weeks *l* _{ i} and give them to managers of the startup. For each *l* _{ i} they should pick some *r* _{ i} ≥ *l* _{ i} and report maximum number of visitors and minimum revenue during this period.

Then, investors will calculate the potential of the startup for each of these ranges and take minimum value of *p*(*l* _{ i}, *r* _{ i}) as the total evaluation grade of the startup. Assuming that managers of the startup always report the optimal values of *r* _{ i} for some particular *l* _{ i}, i.e., the value such that the resulting grade of the startup is maximized, what is the expected resulting grade of the startup?

Input

The first line of the input contains two integers *n* and *k* (1 ≤ *k* ≤ *n* ≤ 1 000 000).

The second line contains *n* integers *v* _{ i} (1 ≤ *v* _{ i} ≤ 10^{7}) — the number of unique visitors during each week.

The third line contains *n* integers *c* _{ i} (1 ≤ *c* _{ i} ≤ 10^{7}) —the revenue for each week.

Output

Print a single real value — the expected grade of the startup. Your answer will be considered correct if its absolute or relative error does not exceed 10^{ - 6}.

Namely: let's assume that your answer is *a*, and the answer of the jury is *b*. The checker program will consider your answer correct, if .

Examples

Input

3 2

3 2 1

300 200 300

Output

133.3333333

Note

Consider the first sample.

If the investors ask for *l* _{ i} = 1 onwards, startup will choose *r* _{ i} = 1, such that max number of visitors is 3 and minimum revenue is 300. Thus, potential in this case is *min*(3·100, 300) = 300.

If the investors ask for *l* _{ i} = 2 onwards, startup will choose *r* _{ i} = 3, such that max number of visitors is 2 and minimum revenue is 200. Thus, potential in this case is *min*(2·100, 200) = 200.

If the investors ask for *l* _{ i} = 3 onwards, startup will choose *r* _{ i} = 3, such that max number of visitors is 1 and minimum revenue is 300. Thus, potential in this case is *min*(1·100, 300) = 100.

We have to choose a set of size 2 equi-probably and take minimum of each. The possible sets here are : {200, 300},{100, 300},{100, 200}, effectively the set of possible values as perceived by investors equi-probably: {200, 100, 100}. Thus, the expected value is (100 + 200 + 100) / 3 = 133.(3).

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/10/2020 07:50:16 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|