"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;
import java.io.*;

class Main{
	public static void main(String[] args){
		Scanner sc= new Scanner(System.in);
		int A = sc.nextInt();
		int B = sc.nextInt();
		int C = sc.nextInt();
		int X = sc.nextInt();
		int Y = sc.nextInt();
		//int a = Integer.MAX_VALUE;
		int max =Math.max(X, Y);
		long temp;
		long money = A*X + B*Y;
		//System.out.println(money);
		for(int i = 1;i <= max;i++){
			if(Y <= i) Y = i;
			if(X <= i) X = i;
			temp = A*(X-i) + B*(Y-i) + 2*C*i;
			//System.out.println(temp);
			if(money > temp) money = temp;
			//System.out.println(i);
		}

		System.out.println(money);
		//System.out.println(a);
	}
}