While in the Galapagos Islands, Darwin noticed a curious fact about the birds on the island. Each bird's beak length and wingspan add up to the same number $$$k$$$. There are $$$n$$$ resources on the island, each with some value $$$v$$$. The $$$i$$$th resource requires a wingspan of at least $$$w_i$$$ and a beak length of at least $$$b_i$$$ to reach. Darwin is curious about the best bird adapted to the environment. Find the maximum possible sum of resource values that is reachable by a bird with beak length and wingspan that adds up to $$$k$$$.
The first line contains two integers $$$n$$$ ($$$1 \leq n \leq 10^5$$$) and $$$k$$$ ($$$1 \leq k \leq 10^5$$$) — the number of resources and the sum of each bird's beak length and wingspan.
The next line contains $$$n$$$ integers, each representing the beak length $$$b_i$$$ ($$$1 \leq b_i \leq 10^5$$$) required to access the $$$i$$$th resource.
The next line contains $$$n$$$ integers, each representing the wingspan $$$w_i$$$ ($$$1 \leq w_i \leq 10^5$$$) required to access the $$$i$$$th resource.
The last line contains $$$n$$$ integers, each representing the value $$$v_i$$$ ($$$1 \leq v_i \leq 10^5$$$) of the $$$i$$$th resource.
Output a single integer — the maximum sum of resource values that can be acquired by a bird with a beak length and wingspan adding up to $$$k$$$.
5 62 2 3 3 45 4 2 2 13 2 4 5 2
11
One possible best bird has a beak length of 4 and a wingspan of 2. It can access the 3rd, 4th, and 5th resource, for a total sum of 11. It can be shown that this is the maximum.
