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



Sample input:
1 2 1 1


Sample output:
2

Submission status: Runtime Error

Solution code:
import collections
a,b,c,d = input().split()
abi=int(min(a,b))
abm=int(max(a,b))
cdi=int(min(c,d))
cdm=int(max(c,d))
res1=[]
res2=[]
if abi<0 and abm<0:
  res1=[abi,abm]
elif abi<0 and abm==0:
  res1=[abi,-1,0]
elif abi==0 and abm==0:
  res1=[0]
elif abi==0 and abm>0:
  res1=[0,1,abm]
elif abi>0 and abm>0:
  res1=[abi,abm]

if cdi<0 and cdm<0:
  res2=[cdi,cdm]
elif cdi<0 and cdm==0:
  res2=[cdi,-1,0]
elif cdi==0 and cdm==0:
  res2=[0]
elif cdi==0 and cdm>0:
  res2=[0,1,cdm]
elif cdi>0 and cdm>0:
  res2=[cdi,cdm]

res=[]
for g in res1:
  for h in res2:
    res.append(g*h)
print(max(res))

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
x_lst = [a, b]
y_lst = [c, d]
max_lst = []
for i in range(len(x_lst)):
    for j in range(len(y_lst)):
        max_lst.append(x_lst[i] * y_lst[j])
print(max(max_lst))

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split())
list_number = []
for i in range(a, b):
  for j in range(c, d):
    list_number.append(i * j)

new_number = sorted(list_number)

print(max(new_number))

Submission status: Runtime Error

Solution code:
s = int(input()).split()

a1 = s[0] * s[2]
a2 = s[0] * s[3]
a3 = s[1] * s[2]
a4 = s[1] * s[3]

list = (a1,a2,a3,a4)

print(max(list))

Submission status: Runtime Error

Solution code:
a, b, c, d = list(map(int, input().split()))

a += 1
c += 1

max = a*c

a*d = x
b*c = y
b*d = z

if max < x :
    max = x
if max < y :
    max = y
if max < z :
    max = z

print(max)

Submission status: Runtime Error

Solution code:
for _ in range(int(input())):
  a,b,c,d=map(int,input().split())
  print(max(a*c,a*d,b*d,b*c))

Submission status: Runtime Error

Solution code:
a,b,c,d = map(int,input().split())
A = a*c
B = a*d
if a<=0:
  if b>=0:
    C = 0
else:
  C = a*c
if c <=0:
  if d >=0:
    D = 0
else:
  D = a*c
E = b*c
F = b*d
print(max([A,B,C,D,E,F]))

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split())

if a > 0 and c > 0:
    ans = b * d
elif  b < 0 and d < 0:
    ans = a * c
elif a >= 0 and d <= 0:
    ans = a * d
elif b <= 0 and c >= 0:
    ans = b * c

    
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c,d=(int(x) for x in input().split())

x = range(a,b+1)
y = range(c,d+1)

X = list(x)
Y = list(y)
MAX = max(X) * max(Y)
print(MAX)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

a, b, c, d = map(int, input().split())

if a >= 0 and c >= 0:
    print(b * d)
    sys.exit(0)

if b <= 0 and d <= 0:
    print(a * c)
    sys.exit(0)

if a <= 0 <= b and c <= 0 <= d:
    print(max(a * c, b * d))
    sys.exit(0)

if b <= 0 and c >= 0:
    pritn(b * c)
    sys.exit(0)

if d <= 0 and a >= 0:
    print(a * d)
    sys.exit(0)

if a <= 0 <= b and d <= 0:
    print(0)
    sys.exit(0)

if c <= 0 <= d and b <= 0:
    print(0)
    sys.exit(0)

Submission status: Runtime Error

Solution code:
ans = a*c
if ans < a*d:
    ans = a*d
elif ans < b*c:
    ans = b*c
elif ans < b*d:
    ans = b*d
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c d = map(int,input().split())

print(max(a*c,b*d,b*c,a*d))

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
aa = a*c
bb = a*d
cc = b*c
dd = b*d
max = aa
if(max<bb):
	max = bb
if(max<cc):
	max = cc
if(max<dd):
	max = dd
print(max)

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split())
if (a>=0) and (b>=0) and (c>=0) and (d>=0):
    ans=b*d
elif (b<=0) and (d<=0):
    ans=a*c
elif (a<=0) and (b>=0) and (c<=0) and (d>=0):
    tmp1=a*c
    tmp2=b*d
    if tmp1>tmp2:
        ans=tmp1
    else:
        ans=tmp2
elif (a>=0) and (b>=0) and (d<=0):
    ans=a*d
elif (c>=0) and (d>=0) and (b<=0):
    ans=b*c
elif (a<=0) and (b>=0) and (c<=0) and (d<=0):
    ans=a*c
elif (a<=0) and (b<=0) and (c<=0) and (d>=0):
    ans=a*c
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
if a<=0 and b<=0 and c<=0 and d<=0:
  print(a*c)
elif a>=0 and b>=0 and c>=0 and d>=0:
  print(b*d)
elif b>=0 and c<=0 d<=0:
  print(b*c)
else:
  print(a*d)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int(),input().split())
maxa=max(a*c,a*d,b*c,b*d)
print(maxa)

Submission status: Runtime Error

Solution code:
a,b,c,d=input().split()
a=int(a)
b=int(b)
c=int(c)
d=int(d)d
list1=[]
list1.append(a*c)
list1.append(a*d)
list1.append(b*c)
list1.append(b*d)
list1.sort()
print(list1[3])

Submission status: Runtime Error

Solution code:
a = list(map(int, input().split()))
print(a)
a_len = list(range((a[0]), a[1] + 1))
b_len = list(range((a[2]), a[3] + 1))

max = -100000
print(a_len, b_len)
for str1 in a_len:
    for str2 in b_len:
        if(str1 * str2 > max):
            max = str1 * str2
print(max)

Submission status: Runtime Error

Solution code:
if b >= 0 and d >= 0 and a <= 0 and c <= 0:
    e = b*d
    f = a*c
    if e > f:
        print(e)
    else:
        print(f)
else:
    e = abs(a)
    f = abs(b)
    g = abs(c)
    h = abs(d)
    l = [e,f,g,h]
    l.sort()
    print(-1*l[0]*l[1])

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split())

if a >= 0 and c >= 0:
    ans = b * d
elif  b <= 0 and d <= 0:
    ans = a * c
elif a >= 0 and d <= 0:
    ans = a * d
elif b <= 0 and c >= 0:
    ans = b * c

    
print(ans)

Submission status: Runtime Error

Solution code:
input_lines = input().split()
num_lines = []
a = int(input_lines[0])
b = int(input_lines[1])
c = int(input_lines[2])
d = int1(input_lines[3])

num_lines.append(a*c)
num_lines.append(a*d)
num_lines.append(b*c)
num_lines.append(b*d)

print(max(num_lines))

Submission status: Runtime Error

Solution code:
a,b,c,d=[int(_) for _ in input().split()]
if a<0 or b<0 or c<0 or d<0:
    print(min(a,b)*max(c,d))
else:
    print(max(a,b)*max(c,d))
5 -4 8 -1

Submission status: Runtime Error

Solution code:
ans = -(10**9)
ans = max(a*d, ans)
ans = max(b*d, ans)
ans = max(a*c, ans)
ans = max(b*c, ans)
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c,d = list(map(int, input().split()))

if a > 0 and b > 0 and c > 0 and d > 0:
  ans = b * d
elif a < 0 and c > 0 and d > 0:
  ans = b * d
elif a < 0 and b < 0 and c > 0 and d > 0:
  ans = b * c
elif a > 0 and b > 0 and c < 0 and d < 0:
  ans = a * d
elif a > 0 and b > 0 and c < 0 and d > 0:
  ans = b * d
elif a < 0 and c < 0:
  ans = a * c

print(ans)

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split())
list_number = []
for i in range(a, b):
  for j in range(c, d):
    list_number.append(i * j)

print(max(list_number))

Submission status: Runtime Error

Solution code:
a,b,c d = map(int,input().split())

print(max(a*c,b*d,b*c,a*d,0))

Submission status: Runtime Error

Solution code:
if b > 0 and d > 0:
    print(max(b*d, a*c))
elif b > 0 and d < 0:
    print(a*d)
elif b < 0 and d > 0:
    print(b*c)
elif b <= 0 and d <= 0:
    print(a*c)

Submission status: Runtime Error

Solution code:
f = open("input.txt", "r")
a, b, c, d = list(map(int, f.readline().split()))

if b <= 0 and d <= 0:
    print(a*c)
elif b < 0 and d >= 0:
    print(max(c, 1)*b)
elif b >= 0 and d < 0:
    print(max(a, 1)*d)
else:
    print(b*d)

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=int(input())

e=[]
e.append(a*c)
e.append(a*d)
e.append(b*c)
e.append(b*d)
print(max(e))

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int(),input().split())
maxa=a*c
e=a*d
f=b*c
g=b*d
h=max(maxa,e)
j=max(f,g)
if h>j:
  print(h)
else:
  print(j)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,(input().split())
x,y=0,0
if a>b:
    x=a
else:
    x=b
if c>d:
    y=c
else:
    y=d
print(x*y)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
List=[]
for i in range(a,b+1):
  for j in range(c,d+1):
    if i>=0 and j>=0:
      List.append(i*j)
max(List)

Submission status: Runtime Error

Solution code:
a, b, c, d = list(map(int, input().split()))
# minus minus
if b <= 0 and d <= 0:
    ans = a*c
# minus plus
if b <= 0 and c >= 0:
    ans = b*c
# plus minus
elif 0 <= a and d <= 0:
    ans = a*d
# plus plus
if a >= 0 and c >= 0:
    ans = b*d
print(ans)

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split())
for i in range(a, b + 1):
    for j in range(c, d + 1):
        print(max(i * j))

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().spit())
p=a*c
q=a*d
r=b*c
s=b*d
print(max(p,q,r,s))

Submission status: Runtime Error

Solution code:
a,b,c,d=int(input().split())
a=int(a)
b=int(b)
c=int(c)
d=int(d)
list1=[]
list1.append(a*c)
list1.append(a*d)
list1.append(b*c)
list1.append(b*c)
list1.sort()
print(list1[3])

Submission status: Runtime Error

Solution code:
a,b,c,d=input().split(' ')
x=max(a,b)
y=max(c,d)
print(x*y)

Submission status: Runtime Error

Solution code:
def resolve():
    a, b, c, d = map(int, input().split()
    w = a*c
    x = a*d
    y = b*c
    z = b*d
    ans = max(w, x, y, z)
    print(ans)
    
    
resolve()

Submission status: Runtime Error

Solution code:
def main():
    l = list(map(int, input().split()))
    x = [i for i in range(l[0],l[1])]
    y = [i for i in range(l[2],l[3])]
    all_pair = [x*y  for i in x for j in y]
    print(sorted(all_pair)[-1])
if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
a,b,c,d = map(int, input().split())
l = [a*c, a*d, b*c, b*d]
print(max[l])

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
print (max(a*c,a*d,b*c,b*d)

Submission status: Runtime Error

Solution code:
a,b,c,d=list(map(int, input().split()))
ac=a*c
ad=a*d
bc=b*c
cd=b*d
print(max([ac,ad,bc,bd]))

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
sum = []
sum.append(a*c)
sum.append(a*d)
sum.append(b*c)
sum.append(b*d)
print(max(sum))

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
ans=-999999999999999999
for i in range(a,b+1):
  for j in range(c,d+1):
    ans=max(ans,i*j)

print(ans

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define vec(a) vector<int>a
using namespace std;


int main()
{
#ifndef ONLINE_JUDGE
	freopen("output.txt", "w", stdout);
	freopen("input.txt", "r", stdin);
#endif
	ll a,b,c,d;
	cin>>a>>b>>c>>d;
	ll arr[4];
	arr[0]=a*c;
	arr[1]=a*d;
	arr[2]=b*c;
	arr[3]=b*d;
	sort(arr,arr+4);
	cout<<arr[3]<<"\n";
	return 0;
}

Submission status: Runtime Error

Solution code:
a, b, c, d = [int(i) for i in input()]
print(max([a * d, a * c, b * c, b * d]))

Submission status: Runtime Error

Solution code:
X = list(map(int, input().split()))

print(max{X[0]*X[1], X[1]*X[2], X[2]*X[3], X[3]*X[0], X[0]*X[2],
         X[1]*X[3]})

Submission status: Runtime Error

Solution code:
#include<iostream>
using namespace std;
int main()
{
	long long a,b,c,d,s,ss;
	cin>>a>>b>>c>>d;
	if ((a<=0 && 0<=b) || (c<=0 && 0<=d))k=1;
	s=max(a*c,a*d);
	ss=max(b*c,b*d);
	s=max(s,ss);
	if (k==1)s=max(0,s);
	cout<<s;
}

Submission status: Runtime Error

Solution code:
a,b,c,d=int(input())
list1=[]
list1.append(a*c)
list1.append(a*d)
list1.append(b*c)
list1.append(b*c)
list1.sort()
print(list1[3])

Submission status: Runtime Error

Solution code:
a,b,c,d = map(int,input().split())
print(max(a*c,a*d,b*c,b*d)

Submission status: Runtime Error

Solution code:
a1 = a * c
a2 = a * d
a3 = b * c
a4 = b * d

list = [a1,a2,a3,a4]
print(max(list))

Submission status: Runtime Error

Solution code:
a,b,c,d=input().split()
a=int(a)
b=int(b)
c=int(c)
d=int(d)
if a>0:
  if b*d>a*c
    print(b*d)
  else:
    print(a*c)
else:
  if a*c>b*d:
    print(a*c)
  else:
    print(b*d)

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split())
x = list(range(a,b+1))
y = list(range(c, d+1))
ans = []
for i in x:
    for j in y:
        ans.append(i*j)

print(max(ans))

Submission status: Runtime Error

Solution code:
_,b,_,d = map(int,input().split())
print(int(b*d)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
ans = -10**9
for i in range([a,b]):
  for j in range([c,d]):
    ans = max(ans, i*j)

print(ans)

Submission status: Runtime Error

Solution code:
a,b,c,d = map(int, input().split())

if b>=0 and d>= 0:
    ans = b*d
elif b < 0 and d >= 0:
    if c <= 0: ans = max(ans,0)
    else: ans = b*c
elif b >= 0 and d < 0:
    if a <= 0: ans = 0
    else: ans = a*d
else:
    ans = a*c

if a <= 0 and c <= 0:
    ans = max(ans,a*c)

print(ans)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(false);  cin.tie(NULL); cout.tie(NULL);
#define scan(a,n) for(long long int index=0;index<n;index++) cin>>a[index];
#define print(a,n) for(long long int index=0;index<n;index++) cout<<a[index]<<" ";cout<<endl;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ss second
#define ff first
#define vli vector<long long int>
#define vlli vector<pair<long long int,long long int>>
#define vsi vector<string>
#define vci vector<char>
#define all(n) n.begin(),n.end()
#define forr(i,a,b) for(i=a;i<b;i++)
#define forrr(i,a,b) for(i=b-1;i>=a;i--)


 
int main() {
   #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    fast;
    ll t;
    t=1;
    while(t--){
       ll a, b, c, d;
    cin>>a>>b>>c>>d;
    vli v;
    v.pb(a*c);
    v.pb(a*d);
    v.pb(b*c);
    v.pb(b*d);
    cout<<*max_element(all(v));

            




    }
    
return 0;    
 }

Submission status: Runtime Error

Solution code:
a = [int(x) for x in input().split()]
print(max(a[0]*a[2],a[1]*a[3])

Submission status: Runtime Error

Solution code:
a,b,c,d = map(int,input().split())

if a < b:
    x = b
if a < b:
    x = a

if c < d:
    y = d
if c > d:
    y = c
print(x*y)

Submission status: Runtime Error

Solution code:
a,b,c,d = map(int,input())
print(max(a*c,a*d,b*c,b*d))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpl;
typedef vector<vi> vvi;
typedef vector<vll> vvll;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
void __print(vector<bool> v) {bool first = true; cerr << "{"; for (int i = 0; i < static_cast<int>(v.size()); i++) {if (!first) {cerr << ", ";} first = false; __print(v[i]);} cerr << "}";}
template <size_t N>
void __print(bitset<N> bs) {string res = "<"; for (size_t i = 0; i < N; i++) {res += static_cast<char>('0' + bs[i]);} res += '>'; cerr << res;}
template<typename T>
void __print(const T &x) {int j = 0; cerr << "{"; for (auto &i: x) cerr << (j++ ? ", " : ""), __print(i); cerr << "}";}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << "("; __print(x.first); cerr << ", "; __print(x.second); cerr << ")";}
template <typename A, typename B, typename C>
void __print(const tuple<A, B, C> t) {cerr << "("; __print(get<0>(t)); cerr << ", "; __print(get<1>(t)); cerr << ", "; __print(get<2>(t)); cerr << ")";}
template <typename A, typename B, typename C, typename D>
void __print(const tuple<A, B, C, D> t) {cerr << "("; __print(get<0>(t)); cerr << ", "; __print(get<1>(t)); cerr << ", "; __print(get<2>(t)); cerr << ", "; __print(get<3>(t)); cerr << ")";}
void _print() {cerr << " ]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

#ifndef ONLINE_JUDGE
#define deb(...) cerr << "~ [ " << #__VA_ARGS__ << " ] => [ "; _print(__VA_ARGS__)
#define debn(...) cerr << "~ [ "; _print(__VA_ARGS__)
#else
#define deb(...)
#define debn(...)
#endif

#define ALL(DS) (DS).begin(), (DS).end()
#define PB push_back
#define EB emplace_back
#define SZ(DS) (int)((DS).size())
#define fo(ITER, LO, UP) for (ITER = (LO); ITER < (UP); ++ITER)
#define foi(ITER, LO, UP) for (int ITER = (LO); ITER < (UP); ++ITER)
#define foll(ITER, LO, UP) for (ITER = (ll)(LO); ITER < (ll)(UP); ++ITER)
#define folli(ITER, LO, UP) for (ll ITER = (ll)(LO); ITER < (ll)(UP); ++ITER)
#define iter(ITER, DS) for (auto &ITER: DS)

const int M = 1000000007;
const int INF = 1e9 + 5;

void init() {}

void solve() {
    int a, b, c, d; cin >> a >> b >> c >> d;
    
    cout << max({a*c, a*d, b*c, b*d}) << "\n";
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
    init();
    solve();
}

Submission status: Runtime Error

Solution code:
a,b,c,d = int(input().split())
ans_list= []
ans_list.append(a*c)
ans_list.append(a*d)
ans_list.append(b*c)
ans_list.append(b*d)
print max(ans_list)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
print(mac(max(a*c,a*d),max(b*c,b*d)))

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
ans=max[(b*d),(a*c),(a*d),(b*c)]
print(ans)

Submission status: Runtime Error

Solution code:
import sys

def dump(x):
    print(x, file=sys.stderr)


a,b,c,d = [int(i) for i in input()]
ans = max(a*c,a*d,b*c,b*d,)
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
print(max([a*c,a*d,b*c,c*d])

Submission status: Runtime Error

Solution code:
a, b, c, d =[int(s) for s in input().split()]
print(max(a * c, a * d, b * c, b * d)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int,input().split())
g=[]
g.append(a*c)
g.append(a.d)
g.append(b.c)
g.append(b.d)
print(max(g))

Submission status: Runtime Error

Solution code:
lst =map(int, input().split())

max_value = 0
for i in range(len(lst)):
  for j in range(i):
    max_value = max(max_value, lst[i]*lst[j])

print(max_value)

Submission status: Runtime Error

Solution code:
a,b,c,d=map(int, input())
print(max(a*c, a*d, b*c, b*d)

Submission status: Runtime Error

Solution code:
a,b,c,d = map(int,input().split())
answer = 0
ac =a*c
ad = a*d
bc = b*C
bd = b*d
answer = max(ac,ad)
answer = max(answer,bc)
answer = max(answer,bd)
print(answer)

Submission status: Runtime Error

Solution code:
a,b,c,d=int(input())
l=[]
for i in range(a,b+1):
  for j in range(c,d+1):
    l.append(i*j)
    
print(max(l))

Submission status: Runtime Error

Solution code:
a, b, c, d = [int(s) for s in input().split()]
return max(a * c, a * d, b *c, b * d)

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int, input().split())
    print(max([a*c, a*d, b*c, b*d]))