"Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza", "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.

Nakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.

Constraints

* 1 ≤ A, B, C ≤ 5000
* 1 ≤ X, Y ≤ 10^5
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


A B C X Y


Output

Print the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.

Examples

Input

1500 2000 1600 3 2


Output

7900


Input

1500 2000 1900 3 2


Output

8500


Input

1500 2000 500 90000 100000


Output

100000000
import java.util.*;

public class Main {
	public static void main(String[] args) {
		
		Scanner keyboard = new Scanner(System.in); 
		
		long A = keyboard.nextLong();
		long B = keyboard.nextLong();
		long C = keyboard.nextLong();
		long X = keyboard.nextLong();
		long Y = keyboard.nextLong();
		
		long Large = X >= Y ? X : Y;
		long small = X <= Y ? X : Y; 
		
		long sum = 0;
		long nokori = Large - small;
		
		if(A+B > 2*C) {
			sum = small*(2*C);
			
			if(Large == X) {
				if(A < 2*C) {
					sum += nokori*A;
				}else {
					sum += nokori*2*C;
				}
			}else{
				if(B < 2*C) {
					sum += nokori*B;
				}else {
					sum += nokori*2*C;
				}
			}
			
		}else {
			sum = A*X + B*Y;
		}
		
		System.out.print(sum);
		keyboard.close();
	}
}