Alice is creating a candy factory! Unfortunately, in order to minimize production cost she needs to make some complicated decisions.
Each piece of candy undergoes three steps in production. First, the shape of the candy is formed. Then, sourness is added. Finally, the candy is wrapped. Alice has $$$n$$$ machines, each of which is capable of all three tasks, but can only be configured to do one of the three tasks. Further, the $$$i$$$th machine uses $$$a_i$$$ energy to form the candy, $$$b_i$$$ energy to add sourness, and $$$c_i$$$ energy to wrap it. Alice did some research and found that she needs $$$x$$$ of her machines to be configured to form the shape, $$$y$$$ machines to add sourness, and $$$z$$$ machines to wrap the candy. The total energy consumed by her factory is equal to the sum of the energy consumed by each machine. Note that a machine may be configured to do nothing, in which case it will not use any energy.
Please help Alice by finding the minimum energy required for her to build her candy factory!
The first line of input will contain $$$n$$$, $$$x$$$, $$$y$$$, and $$$z$$$. ($$$3 \leq n \leq 10^5$$$, $$$1 \leq x, y, z \leq \min(n, 100)$$$, $$$x + y + z \leq n$$$).
The next line will contain $$$n$$$ space separated integers $$$a_1, a_2, ..., a_n$$$ ($$$1 \leq a_i \leq 10^6$$$) — the energy required by the $$$i$$$th if set to form the shape of the candies.
The next line will contain $$$n$$$ space separated integers $$$b_1, b_2, ..., b_n$$$ ($$$1 \leq b_i \leq 10^6$$$) — the energy required by the $$$i$$$th if set to add sourness to the candies.
The last line will contain $$$n$$$ space separated integers $$$c_1, c_2, ..., c_n$$$ ($$$1 \leq c_i \leq 10^6$$$) — the energy required by the $$$i$$$th if set to wrap the candies.
Output a single integer, denoting the minimum energy required by a factory of Alice configures the machines optimally.
3 1 1 11 2 33 3 22 2 5
5
8 2 1 24 3 2 1 2 3 4 98 2 8 9 3 2 3 19 8 3 2 1 1 6 7
6
