You are given two arrays A,B(1-indexed) of equal size N and a number K.For every index i(1..N) we have to select either A_i or B_i, such that sum of selected numbers is minimum and atleast K numbers from selected numbers must be from array A.

Input Format:
First line contains an integer N, next line contains elements of array A.
Third line contains elements of array B and last line contains an integer K.
Output Format:
Print single integer, the required answer.
Constraints:
1<=N<=1e6
1<=A[i]<=1e9
1<=B[i]<=1e9
0<=K<=N