DDR Stamina Management

Coderbak, a rhythm gamer, has recently been hooked on Dance Dance Revolution (DDR). In this game, the player steps on pads in time with notes that fall while the song plays. The game drains a lot of stamina, so managing stamina matters a great deal.

The song has $N$ sections. For each section $i$ $(1 \leq i \leq N)$, Coderbak can choose to play it or skip it. Playing section $i$ earns $s_i$ points and costs $h_i$ stamina. Skipping a section earns no points and costs no stamina.

When the song starts, Coderbak has $100$ stamina. Before entering each section, his stamina recovers by $K$. This recovery happens whether he plays or skips the section. If the stamina after recovery exceeds $100$, it becomes $100$. If playing a section would drop his stamina below $0$, Coderbak must skip that section.

After a full day of DDR, Coderbak is exhausted and can no longer make decisions about managing his stamina. Write a program that outputs the maximum score he can earn so that he can still perform well.

Game over and other systems not mentioned in this statement are not considered in this problem.

The first line contains two integers $N$ and $K$, separated by a space. $N$ is the total number of sections in the song, and $K$ is the amount of stamina recovered. $(1 \leq N \leq 1000; 1 \leq K \leq 10)$

The second line contains integers $s_1, s_2, \cdots, s_N$, separated by spaces. $(1 \leq s_i \leq 1000)$

The third line contains integers $h_1, h_2, \cdots, h_N$, separated by spaces. $(1 \leq h_i \leq 100)$

Print the maximum score Coderbak can earn.