Bone Appetit

It's Halloween and Suri Bhai is out to get his treats.
There are two sectors in his neighborhood, "Bones" and "Blood". They have $N$ and $M$ people, respectively.

Each person in "Bones" will hand out $X$ treats, and each person in "Blood" will hand out $Y$ treats.
How many treats does Suri Bhai get from visiting everyone in his neighborhood in total?

Input Format

The first line of input contains two space-separated integers $N$ and $M$ — the number of people in "Bones" and "Blood", respectively.
The second line of input contains two space-separated integers $X$ and $Y$ — the number of treats handed out by each person in "Bones" and "Blood", respectively.

Output Format

For each test case output a single integer: the total number of treats Suri Bhai will receive.

Constraints

$0 \leq N, M \leq 100$
$0 \leq X, Y \leq 1000$

Sample 1:

Input

4 2
5 6

Output

32

Solution

a, b = map(int, input().split())
x, y = map(int, input().split())

trick_treats = (a * x) + (b * y)

print(trick_treats)

Input Format

Output Format

Constraints

Sample 1:

Comments