ION Competition Au Score Problem

In the ION competition there are a total of $n$ problems, each with a maximum of 100 points. The $i$-th problem has $a_i$ test cases, and since all test cases are of equal value, each test case is worth (\frac{100}{a_i}) points (thus $a_i$ is a divisor of 100). You have already passed $b_i$ test cases for the $i$-th problem. Using some technical means, you have discovered that this year's Au score cutoff is $t$ points.\n\nNow, assume that if you devote the remaining contest time solely to problem $j$ (and do not work on any other problems), you aim to achieve Au by passing some additional test cases. That is, your final total score, which is given by\n[ \sum_{i=1}^{n} b_i \cdot \frac{100}{a_i} + d \cdot \frac{100}{a_j} \ge t ] where $d$ is the number of additional test cases you pass on problem $j$. For each problem $j$ (with $1 \le j \le n$), determine the minimum integer $d$ required. If it is impossible to reach $t$ even if you pass all remaining test cases on problem $j$ (i.e. if $d > a_j - b_j$), output NaN for that problem.\n\nNote: If your current total score (S_0 = \sum_{i=1}^{n} b_i \cdot \frac{100}{a_i}) is already at least $t$, then you should output 0 for every problem.

inputFormat

The input consists of three lines:\n\nThe first line contains two integers $n$ and $t$, where $n$ is the number of problems and $t$ is the Au score threshold.\nThe second line contains $n$ integers: $a_1, a_2, \ldots, a_n$, where each $a_i$ is a divisor of 100.\nThe third line contains $n$ integers: $b_1, b_2, \ldots, b_n$, where $0 \le b_i \le a_i$.

outputFormat

Output $n$ values separated by spaces. For each problem $j$ (in order from 1 to $n$), output the minimum number of additional test cases to pass on that problem needed to reach or exceed a total score of $t$. If it is impossible for problem $j$, output NaN (without quotes).

sample

2 150
50 100
50 100

0 0