#abc196a. [abc196_a]Difference Max

[abc196_a]Difference Max

Problem Statement

Given are integers aa, bb, cc, and dd.
We will choose integers xx and yy such that axba ≤ x ≤ b and cydc ≤ y ≤ d. Find the maximum possible value of xyx - y here.

Constraints

  • All values in input are integers.
  • \-100ab100\-100 ≤ a ≤ b ≤ 100
  • \-100cd100\-100 ≤ c ≤ d ≤ 100

Input

Input is given from Standard Input in the following format:

aa bb cc dd

Output

Print the answer.


Sample Input 1

0 10
0 10

Sample Output 1

10

(x,y)=(10,0)(x, y) = (10, 0) achieves the maximum value xy=10x - y = 10.


Sample Input 2

-100 -100
100 100

Sample Output 2

-200

Sample Input 3

-100 100
-100 100

Sample Output 3

200