Andy and Bob are the only two delivery men of Pizza-chef store. Today, the store received N orders.
It's known that the amount of tips may be different when handled by different delivery man.
More specifically, if Andy takes the i^th order, he would be tipped Ai dollars and if Bob takes this order,
the tip would be Bi dollars.


They decided that they would distribute the orders among themselves to maximize the total tip money. One order will be handled by only
one person. Also, due to time constraints Andy cannot take more than X orders and Bob cannot take more than
Y orders. It is guaranteed that X + Y is greater than or equal to N, which means that all the orders can be handled
by either Andy or Bob.


Please find out the maximum possible amount of total tip money after processing all the orders.


Input

The first line contains three integers N, X, Y.
The second line contains N integers. The i^th integer represents Ai.
The third line contains N integers. The i^th integer represents Bi.


Output

Print a single integer representing the maximum tip money they would receive.


Constraints
All test:

1 ≤ N ≤ 10^5
1 ≤ X, Y ≤ N; X + Y ≥ N 
1 ≤ Ai, Bi ≤ 10^4


10 points:

1 ≤ N ≤ 20


30 points:

1 ≤ N ≤ 5000

60 points:

1 ≤ N ≤ 10^5


Example
Input:
5 3 3
1 2 3 4 5
5 4 3 2 1

Output:
21

Explanation
Bob will take the first three orders (or the first two) and Andy will take the rest (of course).
n,x,y = map(int,raw_input().split())
n1 = [int(i) for i in raw_input().split()]
n2 = [int(i) for i in raw_input().split()]
num = [n1[i]-n2[i] for i in xrange(n) ]
num.sort(reverse=True)
mx = max(0,n-y)
Mx = min(n,x)
xy = sum(n2)
for i in xrange(mx):
    xy += num[i]
ans = xy
for i in xrange(mx,Mx):
    xy += num[i]
    ans =  max(ans,xy)
print ans