Problem:
Score : 200 points

Problem Statement

Given are integers a,b,c and d.
If x and y are integers and a \leq x \leq b and c\leq y \leq d hold, what is the maximum possible value of x \times y?

Constraints

-10^9 \leq a \leq b \leq 10^9

-10^9 \leq c \leq d \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

a b c d

Output

Print the answer.

Sample Input 1

1 2 1 1

Sample Output 1

2

If x = 1 and y = 1 then x \times y = 1.
If x = 2 and y = 1 then x \times y = 2.
Therefore, the answer is 2.

Sample Input 2

3 5 -4 -2

Sample Output 2

-6

The answer can be negative.

Sample Input 3

-1000000000 0 -1000000000 0

Sample Output 3

1000000000000000000

Solution in C (GCC 9.2.1) (judge verdict: Accepted)

#include<stdio.h>

long long int max(long long int a,long long int b)
{
	if(a>=b)
	{
		return a;
	}
	else
	{
		return b;
	}
}


int main()
{
	long long int a,b,c,d,x1,x2,x3,x4;
	scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
	x1=a*c;
	x2=a*d;
	x3=b*c;
	x4=b*d;
	x1=max(x1,x2);
	x1=max(x1,x3);
	x1=max(x1,x4);
	printf("%lld",x1);
	return 0;
}