"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.Scanner;

public class Main {
public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	int A,B,C,X,Y;
	A=sc.nextInt();
	B=sc.nextInt();
	C=sc.nextInt();
	X=sc.nextInt();
	Y=sc.nextInt();
	C*=2;
	if(C>=A+B) {
		System.out.println(A*X+B*Y);
	}else {
		int min=X>Y?Y:X;
		int result=0;
		result+=(min*C);
		if(X==Y) {
			System.out.println(result);
		}else if(X>Y) {
			int cha=X-Y;
			if(C<A) {
				result+=(C*cha);
				System.out.println(result);
			}else {
				result+=(A*cha);
				System.out.println(result);
			}
		}else if(X<Y) {
			int cha=Y-X;
			if(C<B) {
				result+=(C*cha);
				System.out.println(result);
			}else {
				result+=(B*cha);
				System.out.println(result);
			}
		}
	}
	
	
}
}
