You are given two lists of integers; $M$ and $N,$ and an intege

B $.$ Your task is t$$:

Remove all numbers from $M$ that appear in $N.$

Find the largest possible group of numbers $($more number of elements of $M$ should be present in the group$)$ from the updated list $M$ whose total sum is less than or equal to $B.$

Print the sum of numbers in the above group.

Note

All the integers in $M$ and $N$ are unique.

Input

The first line of input contains $M$ space$-$separated integers.

The second line of input contains $N$ space$-$separated integers.

The third line of input contains an integer B $.$

$q,$

Output

The output should be a single line containing an integer that represents the sum of the numbers in the largest possible group of numbers $($more number of elements$)$ from the updated list $M,$ without exceeding the given integer $B.$

Exaplanation

For example, if the given $M$ space$-$separated integers are $3050102040$ and $N$ space$-$separated integers are $402030$ and the integer is $40.$

After removing the numbers that appear in list $N$ from list $M,$ the remaining numbers are $5010.$

For example, if the given $M$ space$-$separated integers are

$3050$

$102040$ and $N$ space$-$separated integers are $402030$ and the integer is $40.$

After removing the numbers that appear in list $N$ from list $M,$ the remaining numbers are $5010.$

The given integer $B$ is $40.$

The largest group of numbers from the remaining list where sum does not exceed $40$ is $10.$ Adding $50$ to $10$ would exceed $40.$

Therefore, the sum of the numbers in the largest possible group of numbers from the updated list $M,$ without exceeding the given integer $B,$ is $10.$

So the output should be $10.$

For example, if the given $M$ space$-$separated integers are $204010305060$ and $N$ space$-$separated integers are $3010$ and the integer is $60.$