Dropping Tests

In a certain course you take $n$ tests. If you answer $a_i$ out of $b_i$ questions correctly on test $i$, your cumulative average is defined as

$100 \cdot \dfrac{\sum_{i=1}^{n} a_i}{\sum_{i=1}^{n} b_i}$

Given your test scores and a positive integer $k$, determine the highest cumulative average you can achieve if you are allowed to drop any $k$ of your test scores.

For example, suppose you take three tests with scores $5/5$, $0/1$, and $2/6$. Without dropping any test, your cumulative average is $100 \cdot (5+0+2)/(5+1+6) = 50$. However, if you drop the third test, your cumulative average becomes $100 \cdot (5+0)/(5+1) \approx 83.33 \approx 83$.

The input contains multiple test cases, each consisting of exactly three lines.

The first line contains two integers $n$ and $k$ ($1 \le n \le 1000$, $0 \le k < n$). The second line contains $n$ integers giving $a_i$ for every $i$. The third line contains $n$ positive integers giving $b_i$ for every $i$. It is guaranteed that $0 \le a_i \le b_i \le 1{,}000{,}000{,}000$.

The end of input is marked by a test case with $n = k = 0$, which must not be processed.

For each test case, print on a single line the highest cumulative average obtainable after dropping $k$ of the given test scores. Round the average to the nearest integer.

To avoid ambiguities due to rounding errors, the tests are constructed so that every answer is at least $0.001$ away from a rounding boundary (that is, you may assume the average is never something like 83.4997).