Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Vasya and Public Transport

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVasya often uses public transport. The transport in the city is of two types: trolleys and buses. The city has *n* buses and *m* trolleys, the buses are numbered by integers from 1 to *n*, the trolleys are numbered by integers from 1 to *m*.

Public transport is not free. There are 4 types of tickets:

- A ticket for one ride on some bus or trolley. It costs
*c*_{1}burles; - A ticket for an unlimited number of rides on some bus or on some trolley. It costs
*c*_{2}burles; - A ticket for an unlimited number of rides on all buses or all trolleys. It costs
*c*_{3}burles; - A ticket for an unlimited number of rides on all buses and trolleys. It costs
*c*_{4}burles.

Vasya knows for sure the number of rides he is going to make and the transport he is going to use. He asked you for help to find the minimum sum of burles he will have to spend on the tickets.

Input

The first line contains four integers *c*_{1}, *c*_{2}, *c*_{3}, *c*_{4} (1 ≤ *c*_{1}, *c*_{2}, *c*_{3}, *c*_{4} ≤ 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.

Examples

Input

1 3 7 19

2 3

2 5

4 4 4

Output

12

Input

4 3 2 1

1 3

798

1 2 3

Output

1

Input

100 100 8 100

3 5

7 94 12

100 1 47 0 42

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.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/06/2021 17:08:43 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|