Olympiad#1672
At the Olympiad in Informatics, participants were offered problems, each worth A_i points (i = 1..N). Olympian Petya estimated the time B_i minutes required to solve each problem. If the Olympiad lasts hours, what is the maximum score Petya can achieve?
The first line contains the integers and .
The second line contains A_i, and the third contains B_i (i = 1..N).
All numbers are positive integers.
1 \leq N \leq 100, 1 \leq H \leq 10, 1 \leq A_i, B_i \leq 100.
Output the maximum possible sum of points.
Example 1