Vasya and Public Transport

Description:

Input:

The first line contains four integers c₁, c₂, c₃, c₄ (1 ≤ c₁, c₂, c₃, c₄ ≤ 1000) — the costs of the tickets.

The second line contains two integers n and m (1 ≤ n, m ≤ 1000) — the number of buses and trolleys Vasya is going to use.

The third line contains n integers a_i (0 ≤ a_i ≤ 1000) — the number of times Vasya is going to use the bus number i.

The fourth line contains m integers b_i (0 ≤ b_i ≤ 1000) — the number of times Vasya is going to use the trolley number i.

Output:

Print a single number — the minimum sum of burles Vasya will have to spend on the tickets.

Sample Input:

1 3 7 19
2 3
2 5
4 4 4

Sample Output:

12

Sample Input:

4 3 2 1
1 3
798
1 2 3

Sample Output:

1

Sample Input:

100 100 8 100
3 5
7 94 12
100 1 47 0 42

Sample Output:

16

Note:

In the first sample the profitable strategy is to buy two tickets of the first type (for the first bus), one ticket of the second type (for the second bus) and one ticket of the third type (for all trolleys). It totals to (2·1) + 3 + 7 = 12 burles.

In the second sample the profitable strategy is to buy one ticket of the fourth type.

In the third sample the profitable strategy is to buy two tickets of the third type: for all buses and for all trolleys.