Description

Submissions

Python $3.$

HARD

In Progress

Hard

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

B $.$ Your task is to:

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.

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 thira line of input contains an integer $B$

output