A mountain-climbing camp on the Taihang Mountains offers visitors two kinds of activities: a leisure sightseeing route and a challenging climbing route. The camp sets a fitness threshold: when a person's fitness value is strictly greater than this threshold, they will choose the challenging climb; otherwise, they will choose the leisure sightseeing route.

There are currently people. For the -th person, their fitness value is . If they take the leisure sightseeing route, their satisfaction value is ; if they take the challenging climbing route, their satisfaction value is . Before the activities begin, you may reset this fitness threshold so that the total satisfaction value of these people is maximized. You only need to find this maximum possible value.

Note: the fitness threshold can be set to 0, in which case everyone will take the challenging climbing route; it can also be set to infinity, in which case everyone will take the leisure sightseeing route.

The first line contains a positive integer  ().

The second line contains  positive integers  (). It is guaranteed that all  are pairwise distinct.

The third line contains  positive integers  ().

The fourth line contains  positive integers  ().

Output one line containing a positive integer, denoting the maximum possible total satisfaction value.

5
163 145 188 150 176
1 2 3 4 5
5 4 3 2 1

15

One possible plan is to set the fitness threshold to . Then visitors 1, 2, 4, and 5 will all take the leisure sightseeing route, with total satisfaction ; visitor 3 will take the challenging climbing route, with satisfaction . The total satisfaction is . There is no better plan.