Problem:


Score : 100 points

Problem Statement

We have two integers: A and B.

Print the largest number among A + B, A - B, and A \times B.

Constraints

All values in input are integers.

-100 \leq A,\ B \leq 100

Input

Input is given from Standard Input in the following format:

A B

Output

Print the largest number among A + B, A - B, and A \times B.

Sample Input 1

-13 3

Sample Output 1

-10

The largest number among A + B = -10, A - B = -16, and A \times B = -39 is -10.

Sample Input 2

1 -33

Sample Output 2

34

The largest number among A + B = -32, A - B = 34, and A \times B = -33 is 34.

Sample Input 3

13 3

Sample Output 3

39

The largest number among A + B = 16, A - B = 10, and A \times B = 39 is 39.



Sample input:
-13 3


Sample output:
-10

Submission status: Accepted

Solution code:
import numpy as np
x,y = map(int,input().split())
print(np.max([x*y,x+y,x-y]))

Submission status: Accepted

Solution code:
x = str(input())
j = x.split()
a = int(j[0])
b = int(j[1])
print(max((a+b),(a-b),(a*b)))

Submission status: Accepted

Solution code:
ab = input()
ablist = ab.rsplit(" ")

abadd = int(ablist[0]) + int(ablist[1])

abminus = int(ablist[0]) - int(ablist[1])

abmultiply = int(ablist[0]) * int(ablist[1])

if abadd > abminus:
 if abadd > abmultiply:
  print(abadd)
 else:
  print(abmultiply)
else:
 if abminus > abmultiply:
  print(abminus)
 else:
  print(abmultiply)

Submission status: Accepted

Solution code:
N = input().split()
A = int(N[0])
B = int(N[1])
if A+B >= A-B and A+B >= A*B:
    print(A+B)
elif A-B >= A+B and A-B >= A*B:
    print(A-B)
elif A*B >= A+B and A*B >= A-B:
    print(A*B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
n = a + b
m = a - b
l = a*b
print(max(n, m, l))

Submission status: Accepted

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

print(max(A-B, A+B, A*B))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
As = list()
As.append(A + B)
As.append(A - B)
As.append(A * B)
print(max(As))

Submission status: Accepted

Solution code:
A, B = [int(v) for v in input().split(' ')]

print(max([A + B, A - B, A * B]))

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc137/tasks/abc137_a

i = [int(i) for i in input().split(' ') for l in range(1)]

print(max(i[0] + i[1], i[0] - i[1], i[0] * i[1]))

Submission status: Accepted

Solution code:
import math
a, b = map(int, input().split())

print(max(a+b,a-b,a*b))

Submission status: Accepted

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

Submission status: Accepted

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

if a+b >= a-b:
    if a+b >= a*b:
        print(a+b)
    else:
        print(a*b)
else:
    if a-b >= a*b:
        print(a-b)
    else:
        print(a*b)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c=[a+b,a-b,a*b]
c.sort()
print(c[2])

Submission status: Accepted

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

wa = A + B
sa = A - B
seki = A * B

print(max(wa, sa, seki))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
x=a+b
if x<(a*b):
  x=a*b
elif x<(a-b):
  x=a-b
print(x)

Submission status: Accepted

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

ans = A[0] + A[1]

if A[0] * A[1] > ans:
    ans = A[0] * A[1]
if A[0] - A[1] > ans:
    ans = A[0] - A[1]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
arr = []
add_ab = a + b
arr.append(add_ab)
subtraction_ab = a - b
arr.append(subtraction_ab)
multiplication_ab = a * b
arr.append(multiplication_ab)
answer = max(arr)
print(answer)

Submission status: Accepted

Solution code:
tmp = list(map(int, input().split()))
A = tmp[0]
B = tmp[1]

print( max(A+B, A-B, A*B) )

Submission status: Accepted

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

for i in range(3):
    c.append(a+b)
    c.append(a-b)
    c.append(a*b)

print(str(max(c)))

Submission status: Accepted

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

print(max((A+B,A-B,A*B)))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A + B >= A - B:
    if A + B>=A * B:
        print(A + B)
    else :
        print(A * B)
else :
    if A - B >= A * B:
        print(A - B)
    else:
        print(A * B)

Submission status: Accepted

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

X = []
X.append(A+B)
X.append(A-B)
X.append(A*B)

X.sort()

print(X[2])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
item = list()
item.append(a+b)
item.append(a-b)
item.append(a*b)
print(max(item))

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
ans_1 = a + b
ans_2 = a - b
ans_3 = a * b
print (max(ans_1,ans_2,ans_3))

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
C=A+B
if(C<A-B):
    C=A-B
if(C<A*B):
    C=A*B
print(C)

Submission status: Accepted

Solution code:
from sys import exit, stderr, stdin
input = stdin.readline
# setrecursionlimit(10**7)

def debug(var, name="hoge"):
    print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
    return


def main():
    A, B = [int(n) for n in input().split()]
    print(max(A-B, A+B, A*B))



if __name__ == "__main__":
    main()

Submission status: Accepted

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

ans = (a+b, a-b, a*b)
print(max(ans))

Submission status: Accepted

Solution code:
a, b = input().split()
a = int(a)
b = int(b)
add = a+b
minus = a-b
multiply = a*b
result = max(add, minus, multiply)
print(result)

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))
s = A + B
d = A - B
m = A * B
ab_list = [s, d, m]
print(max(ab_list))

Submission status: Accepted

Solution code:
a, b = map(int,input().split())#標準入力を行う

print(max(a-b,a+b,a*b))

Submission status: Accepted

Solution code:
a, b = map(int, raw_input().split())
print max(
    a + b,
    a - b,
    a * b
)

Submission status: Accepted

Solution code:
s = input().split()
a, b = int(s[0]), int(s[1])
print(max([int(s[0])+int(s[1]), int(s[0])-int(s[1]), int(s[0])*int(s[1])]))

Submission status: Accepted

Solution code:
s = input().split()
a, b = int(s[0]), int(s[1])
x = [a+b, a-b, a*b]
print(max(x))

Submission status: Accepted

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

print(max(a+b, a-b, a*b))

Submission status: Accepted

Solution code:
I0 = lambda :map(int,input().split())
I1 = lambda :int(input())
I2 = lambda :list(map(int,input().split()))
#####################################################
A,B = I0()
print(max([A*B,A-B,A+B]))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x = a + b
y = a * b
z = a - b
if x >= y and x >= z:
    print(x)
elif y >= z:
    print(y)
else:
    print(z)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


def main(a, b):
    res = [0]*3
    res[0] = a + b
    res[1] = a - b
    res[2] = a * b

    return max(res)


if __name__ == "__main__":
    a, b = map(int, input().split())
    print(main(a, b))

Submission status: Accepted

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

print(max(a + b, a - b, a * b))

Submission status: Accepted

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

print(max(a+b,a-b,a*b))

Submission status: Accepted

Solution code:
a,b=list(map(int,input().split(" ")))
print(max(a*b,a+b,a-b))

Submission status: Accepted

Solution code:
def found_max(a,b):
    return max(a*b,a+b,a-b)

a,b=list(map(int,input().split(" ")))
print(found_max(a,b))

Submission status: Accepted

Solution code:
n,m = input().split()
n = int(n)
m = int(m)

print(max(n+m,n-m,n*m))

Submission status: Accepted

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

tasu = a+b
hiku = a-b
kake = a*b

l = [tasu,hiku,kake]

print(max(l))

Submission status: Accepted

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

num1 = x + y
num2 = x - y
num3 = x * y

if num1 > num2:
    if num1 > num3:
        ans = num1
    else:
        ans = num3
elif num2 > num3:
    ans = num2
else:
    ans = num3

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
ans = max(a+b,a-b,a*b)
print(ans)

Submission status: Accepted

Solution code:

import collections

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

x1 = a+b
x2 = a-b
x3 = a*b

result_L = [x1,x2,x3]

print(max(result_L))

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
print(max(a+b, a-b, a*b))

Submission status: Accepted

Solution code:
A, B = map(int, input(). split())
print(max([A+B, A-B, A*B]))

Submission status: Accepted

Solution code:
def getlist():
	return list(map(int, input().split()))

A, B = getlist()
print(max(A + B, A - B, A * B))

Submission status: Accepted

Solution code:

A,B = map(int,input().split())

print( max(A+B,A-B,A*B))

Submission status: Accepted

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

print(max(a+b,a-b,a*b))

Submission status: Accepted

Solution code:
A,B= map(int , input().split())
print(max(A+B, A-B, A*B))

Submission status: Accepted

Solution code:
a, b=map(int, input().split())
li = [a+b, a-b, a*b]

print(max(li))

Submission status: Accepted

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

x1 = a+b
x2 = a-b
x3 = a*b

result_L = [x1,x2,x3]

print(max(result_L))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x = [a + b, a - b, a * b]
print(max(x))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x = [a + b, a - b, a * b]
print(max(x))

Submission status: Accepted

Solution code:

a, b = map(int, input().split())
x1 = a + b
x2 = a - b
x3 = a * b

if x1 >= x2 and x1 >= x3:
    print(x1)
elif x2 >= x1 and x2 >=x3:
    print(x2)
elif x3 >= x1 and x3 >= x2:
    print(x3)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
 
print(max(A+B, A-B, A*B))

Submission status: Accepted

Solution code:
a,b = (int(i) for i in input().split())
print(max(a+b,a-b,a*b))

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
i=a+b
j=a-b
k=a*b
print(max(i,j,k))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
m=a+b
n=a-b
x=a*b
ma=max(m,n)
ma=max(ma,x)
print(ma)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, raw_input().split())
print max(max(A + B,A - B), A * B)

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline

A, B = [int(x) for x in input().split()]

answer = []
answer.append(A + B)
answer.append(A * B)
answer.append(A - B)

print(max(answer))

Submission status: Accepted

Solution code:
def maximum(a,b):
    x = [a+b,a-b,a*b]
    return max(x)
  
A, B = map(int, input().split())
print(maximum(A,B))

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))
  
print(max([A+B, A-B, A*B]))

Submission status: Accepted

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

print(max([A+B,A*B,A-B]))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
li=[A+B,A-B,A*B]
print(max(li))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
x = a+b
y = a-b
z = a*b
print(max(x,y,z))

Submission status: Accepted

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

lis = [x*y,x+y,x-y]
print(max(lis))

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    ans = max(a + b, a - b, a * b)
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b = map(int, input().split(" "))
tmp = [a+b, a-b, a*b]
print(max(tmp))

Submission status: Accepted

Solution code:
a,b =[int(i) for i in input().split()]
print(max(a+b, a*b, a-b))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    
    a, b = map(int, input().split())
    print(max(a+b, a-b, a*b))

Submission status: Accepted

Solution code:
A,B = map(int,input().split()) 
print(max(A+B,A-B,A*B))

Submission status: Accepted

Solution code:
A, B= map(int, input().split())
c= A+B
d= A-B
e= A*B
f=max(c, d, e)
print(f)

Submission status: Accepted

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

c=a+b
d=a-b
e=a*b
print(max(c,d,e))

Submission status: Accepted

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

l = []

l.append(a+b)
l.append(a-b)
l.append(a*b)

ans = max(l)

print(ans)

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
sum = A[0] + A[1]
dif = A[0] - A[1]
tim = A[0] * A [1]
B = [sum,dif,tim]
B.sort()
print(B[2])

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
li = [0,0,0]
li[0] = A+B
li[1] = A-B
li[2] = A*B
print(max(li))

Submission status: Accepted

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

x = max([A + B, A - B, A * B])

print(x)

Submission status: Accepted

Solution code:
ls = [int(i) for i in input().split()]

a = ls[0]
b = ls[1]

s = a+b
d = a-b
m = a*b

print(max(s,d,m))

Submission status: Accepted

Solution code:
a, b = input().split(" ")
a = int(a)
b = int(b)

add = a + b
diff = a - b
mul = a * b

print(max(add, diff, mul))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
a=A+B
b=A-B
c=A*B
if a>=b and a>=c:
  print(a)
elif b>=a and b>=c:
  print(b)
else:
  print(c)

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
print(max([a+b, a-b, a*b]))

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
a=l[0]
b=l[1]
print(max(a+b,a-b,a*b))

Submission status: Accepted

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

lst = [a+b,a-b,a*b]

print(max(lst))

Submission status: Accepted

Solution code:
from sys import stdin
 
a, b = [int(x) for x in stdin.readline().rstrip().split()]
print(max(a+b, a-b, a*b))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
 
ab1=a+b
ab2=a-b
ab3=a*b
print (max(ab1,ab2,ab3))

Submission status: Accepted

Solution code:
def main(): 
    a,b=map(int, input().split())

    print(max(a+b,a-b,a*b))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    A, B = map(int, input().split())
    print(max([A + B, A - B, A * B]))

Submission status: Accepted

Solution code:
nums = input().split(" ")
a = int(nums[0])
b = int(nums[1])
list = []
list.append(a+b)
list.append(a-b)
list.append(a*b)
print(max(list))

Submission status: Accepted

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

a = i[0]+i[1]
b = i[0]*i[1]
c = i[0]-i[1]

print(max(a,b,c))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
List = [A+B,A-B,A*B]
List = sorted(List)
print (List[-1])

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
M = A + B
N = A - B
R = A * B
print(max(M, N, R))

Submission status: Accepted

Solution code:
import numpy as np
A, B = list(map(int,input().split()))
print(np.max((A+B, A-B, A*B)))

Submission status: Accepted

Solution code:
import numpy as np

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

ans = [a + b, a- b, a * b]

print(np.amax(ans))

Submission status: Accepted

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

Submission status: Accepted

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

print(max(A * B, A + B, A - B))

Submission status: Accepted

Solution code:
a,b = input().split()
#print(A,B)
A=int(a)
B=int(b)
print(max(A+B,A-B,A*B))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
print(sorted([A+B,A-B,A*B])[2])

Submission status: Accepted

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

Submission status: Accepted

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

print(max((a + b), (a * b), (a - b)))

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().strip().split()]

print(max(a + b, a - b, a * b))

Submission status: Accepted

Solution code:
a, b = map(int, input().split(' '))
print(max([a + b, a-b, a*b]))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
 
m = a+b
if m<a*b:
    m = a*b
if m<a-b:
    m=a-b
print(m)

Submission status: Accepted

Solution code:
a,b=map(int,input().split( ))
sm = a+b
sb = a-b
mlt = a*b
mx =max(sm,sb,mlt)
print(mx)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
n_l = [a+b,a-b,a*b]
print(max(n_l))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a, b = map(int, input().split())
print(max(a+b, a-b, a*b))

Submission status: Accepted

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

target = list()

target.append(A+B)
target.append(A-B)
target.append(A*B)

print(max(target))

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
x = a+b
y = a-b
z = a*b

max = x
if max - y < 0:
    max = y
if max - z < 0:
    max = z
    
print(max)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
print(max([i[0]+i[1], i[0]-i[1], i[0] * i[1]]))

Submission status: Accepted

Solution code:
import numpy as np


def main():
    A, B = map(int, input().split())
    ans = max(A * B, max(A - B, A + B))
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

c = a + b
d = a - b
e = a * b

l=[]
l.append(c)
l.append(d)
l.append(e)
l.sort()
print(l[2])

Submission status: Accepted

Solution code:
A,B = list(map(int,input().split()))
a = A+B
b = A-B
c = A*B
print(max(a,b,c))

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
add = a+b
minus = a-b
multi = a*b
print(max([add,minus, multi]))

Submission status: Accepted

Solution code:
A,B = map(int, input().split())
print(max(A+B,A-B,A*B))

Submission status: Accepted

Solution code:
a, b= (int(i) for i in input().split())
c = max([a+b, a-b,a*b]);
print(c)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A,B=map(int,input().split())
print(max(A+B,A-B,A*B))

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
A = a[0]
B = a[1]
add = A+B
sub = A-B
mul = A*B
l = [add,sub,mul]
l.sort()
print(l[-1])

Submission status: Accepted

Solution code:
A, B = map(int, input().split(" "))
tas = A + B
hiku = A - B
kakeru = A * B
largest = max(tas, hiku, kakeru)
print(largest)

Submission status: Accepted

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

ans = max(A+B, A-B, A*B)

print(ans)

Submission status: Accepted

Solution code:
str = str(input())
num1 = int(str.split()[0])
num2 = int(str.split()[1])

wa = num1 + num2
sa = num1 - num2
seki = num1 * num2

if wa >= sa:
  if wa >= seki:
    print(wa)
  else:
    print(seki)
elif sa >= seki:
  print(sa)
else:
  print(seki)

Submission status: Accepted

Solution code:
A ,B = map(int,input().split())
v1 = A+B
v2=A-B
v3=A*B
C=[v1,v2,v3]
print(max(C))

Submission status: Accepted

Solution code:
input_data=input()
input_data=input_data.split()
A=int(input_data[0])
B=int(input_data[1])
output=max(A+B,A-B,A*B)
print(output)

Submission status: Accepted

Solution code:
a,b = list(map(int,input().split(" ")))
print(max( a+b,a - b,a * b )  )

Submission status: Accepted

Solution code:
A,B=[int(i) for i in input().split()]
print(max([A+B,A-B,A*B]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
ans = [A+B,A-B,A*B]
print(max(ans))

Submission status: Accepted

Solution code:
import numpy as np
a,b=map(int,input().split())
s=np.max([a+b,a-b,a*b])
print(s)

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
add = a+b
minus = a-b
multi = a*b
print(max([add,minus, multi]))

Submission status: Accepted

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

print(max(a-b,a+b,a*b))

Submission status: Accepted

Solution code:
# -*- coding:utf8 -*-

a,b = map(int,input().split())
print(max([a+b, a-b, a*b]))

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
max = [a+b, a-b, a*b]
max.sort(reverse=True)
print(max[0])

Submission status: Accepted

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

calc_1 = a + b
calc_2 = a - b
calc_3 = a * b

print(max(calc_1, calc_2, calc_3))

Submission status: Accepted

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

print(max(c,d,e))

Submission status: Accepted

Solution code:
inputs = input().split()
a      = int(inputs[0])
b      = int(inputs[1])
if -100 <= a and b <= 100:
	print(max([a+b, a-b, a*b]))
else:
	raise ValueError

Submission status: Accepted

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

plus = a+b
minus = a-b
multi = a*b
ans = max(plus, minus, multi)
print(ans)

Submission status: Accepted

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

ans = a[0] + a[1]
if ans < a[0] - a[1]:
	ans = a[0] - a[1]
if ans < a[0] * a[1]:
	ans = a[0] * a[1]

print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
ans =max(a+b,a*b,a-b)
print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split());print(max(a+b,a*b,a-b))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
i=a+b
j=a-b
k=a*b
biggest=[i,j,k]
biggest_1=sorted(biggest)
print(biggest_1[-1])

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
max_=max([a+b, a-b, a*b])
print(max_)

Submission status: Accepted

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

print(max(a + b,a - b, a*b))

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
pl=a+b
mi=a-b
ka=a*b
print(max(pl,mi,ka))

Submission status: Accepted

Solution code:
num = list(map(int, input().split()))
print(max(num[0] + num[1],num[0] - num[1],num[0] * num[1]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = list(map(int,input().split()))
print(max(A+B,A-B,A*B))

Submission status: Accepted

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

print(max([A+B,A*B,A-B]))

Submission status: Accepted

Solution code:
A,B=[int(i) for i in input().split(" ")]
print(max([A+B,A-B,A*B]))

Submission status: Accepted

Solution code:
A, B = [int(i) for i in input().split(" ")] 
print(max([A+B, A-B, A*B]))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
compare_list = []
compare_list.append(A + B)
compare_list.append(A - B)
compare_list.append(A * B)

print(max(compare_list))

Submission status: Accepted

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

candidate = [a + b, a - b, a * b]
ans = max(candidate)
print(ans)

Submission status: Accepted

Solution code:
n1, n2 = [int(i) for i in input().split()]

r1 = n1 + n2

if r1 < (n1 - n2):
    r1 = n1 - n2

if r1 < (n1 * n2):
    r1 = n1 * n2

print(r1)

Submission status: Accepted

Solution code:
A,B = list(map(int, input().split()))
print(max(A+B, A-B, A*B))

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
a,b=map(int,input().split())
print(max(a+b,a-b,a*b))

Submission status: Accepted

Solution code:
a , b = input().split()
a =int(a)
b =int(b)
print (max(a + b,a - b,a * b))

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
print(max(A[0]+A[1],A[0]-A[1],A[0]*A[1]))

Submission status: Accepted

Solution code:
a,b=[int(i) for i in input().split()]
print(max(a+b,a-b,a*b))

Submission status: Accepted

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

print(max(a*b, a+b, a-b))

Submission status: Accepted

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

print(max(a+b, a-b, a*b))

Submission status: Accepted

Solution code:
s = input().split()
a = int(s[0])
b = int(s[1])
x1 = a+b
x2 = a-b
x3 = a*b
print(max(x1,x2,x3))

Submission status: Accepted

Solution code:
INPUT = input().split(" ")
a = int(INPUT[0])
b = int(INPUT[1])
print(max(a+b,a-b,a*b))

Submission status: Accepted

Solution code:
a, b = (int(i) for i in input().split())
add = a + b
sub = a - b
mul = a * b
print(max(add, sub, mul))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print(a+b if a+b>a-b and a+b>a*b else a-b if a-b>a*b else a*b)

Submission status: Accepted

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

x = a+b
y=  a-b
z = a*b

ans = max([x,y,z])
print(ans)

Submission status: Accepted

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

print(max(A+B, max(A-B, A*B)))

Submission status: Accepted

Solution code:
a,b=[int(i) for i in input().split()]
print(max([a+b,a*b,a-b]))

Submission status: Accepted

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

if A + B > A - B:
    answer = A + B
else:
    answer = A - B

if A * B > answer:
    answer = A * B

print(answer)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
l=a+b
m=a-b
n=a*b
print(max(l,m,n))

Submission status: Accepted

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

ans = [a + b, a - b, a * b]

ans = sorted(ans, reverse = True)

print(ans[0])

Submission status: Accepted

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

plus = a + b 

mai = a - b

kake = a * b 

print(max(plus,mai,kake))

Submission status: Accepted

Solution code:
li = list(map(int,input().split()))
li1 = [li[0] + li[1], li[0] * li[1], li[0] - li[1]]
print(max(li1))

Submission status: Accepted

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

print(sorted([a+b,a-b,a*b])[-1])

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
ans = [A+B, A-B, A*B]
print(max(ans))

Submission status: Accepted

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

Submission status: Accepted

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

summation = A[0] + A[1]
sub = A[0] - A[1]
mul = A[0] * A[1]
print(max(summation, sub, mul))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A ,B = map(int, input().split())
result = sorted([A+B, A-B, A*B])
print(result[2])

Submission status: Accepted

Solution code:
def solve():
    a, b = read()
    result = think(a, b)
    write(result)


def read():
    return read_int(2)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a, b):
    return max([a + b, a - b, a * b])


def write(result):
    print(result)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

print(sorted([A+B, A-B, A*B], reverse=True)[0])

Submission status: Accepted

Solution code:
a,b= (int(i) for i in input().split()) 
print(max(a+b,a-b,a*b))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

A, B = map(int, input().split())

# print(A)
# print(B)

tasu = A + B
hiku = A - B
kakeru = A * B

# print(max([tasu, hiku, kakeru]))

print(max([A + B, A - B, A * B]))

Submission status: Accepted

Solution code:
def larger(x, y):
	if x > y: return x
	return y

A, B = map(int, input().split())
p = A + B
m = A - B
t = A * B
print(larger(p, larger(m, t)))

Submission status: Accepted

Solution code:

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

c1 = a + b
c2 = a - b
c3 = a * b

print( max(c1,c2,c3) )

Submission status: Accepted

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

print(max(a+b,a-b,a*b))

Submission status: Accepted

Solution code:
input_ab = list(map(int, input().split()))
calc_plus = input_ab[0] + input_ab[1]
calc_minus = input_ab[0] - input_ab[1]
calc_times = input_ab[0] * input_ab[1]
result = [calc_plus, calc_minus, calc_times]
result.sort()
print(result[2])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
max = a+b
if max < a-b:
    max = a-b
if max < a*b:
    max = a*b
print(max)

Submission status: Accepted

Solution code:
import numpy
a = input()
a = a.split()
a = [int(b) for b in a]
plus = a[0] + a[1]
minus = a[0] - a[1]
multi = a[0] * a[1]
print(numpy.max([plus,minus,multi]))

Submission status: Accepted

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


ans = []
ans.append(a + b)
ans.append(a - b)
ans.append(a * b)

print(max(ans))

Submission status: Accepted

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

wa=a+b
sa=a-b
seki=a*b

list=[wa,sa,seki]
list.sort(reverse=True)
print(list[0])

Submission status: Accepted

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

max = max(A+B, A-B, A*B)

print(max)

Submission status: Accepted

Solution code:
# A - +-x

_input = list(map(int, input().split()))
a = _input[0]
b = _input[1]

print(max((a + b), (a - b), (a * b)))

Submission status: Accepted

Solution code:
n = list(int(i) for i in input().split())
print(max(sum(n), n[0]-n[1], n[0]*n[1]))

Submission status: Accepted

Solution code:
A,B =map(int,input().split())
print(max(A+B,A-B,A*B))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Aug 21 22:44:08 2019

@author: Yamazaki Kenichi
"""

A, B = map(int,input().split())
print(max(A+B,A-B,A*B))

Submission status: Accepted

Solution code:
a,b = [int(i) for i in input().split()]

print(max(a+b, a-b, a*b))

Submission status: Accepted

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

num_list = [A+B, A-B, A*B]
print(max(num_list))

Submission status: Accepted

Solution code:
a, b = map(int, input().split(" "))
print(max(a+b, a-b, a*b))

Submission status: Accepted

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

print(max(A + B, A - B, A * B))

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
ad = A+B
mi = A-B
bi = A*B
if ad > mi:
  if ad > bi:
    print(ad)
  else:
    print(bi)
else:
  if mi > bi:
    print(mi)
  else:
    print(bi)

Submission status: Accepted

Solution code:
A, B = list(map(int, input().split()))
print(max([A+B, A-B, A*B]))

Submission status: Accepted

Solution code:
# スペース区切りの整数の入力
A, B = map(int, input().split())
#出力
print(max([A+B, A-B, A*B]))

Submission status: Accepted

Solution code:
# coding: utf-8
 
A, B = list(map(int, input().split()))
 
print(max(A+B, A-B, A*B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int,input().split())
ans = max(A+B, A-B, A*B)
print(ans)

Submission status: Accepted

Solution code:
A, B = (input().split())

ans = max(int(A) + int(B), int(A) - int(B), int(A) * int(B))

print(ans)

Submission status: Accepted

Solution code:
# 整数AとBの入力
A, B = map(int, input().split())
# 整数AとBの和・差・積の中で最大の数を出力
print("{}".format(max([A + B, A - B, A * B])))

Submission status: Accepted

Solution code:
A,B = input().split()
A,B = int(A),int(B)
ans = [A+B,A-B,A*B]
ans.sort()
print(ans.pop())