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 .

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

Solution (Python):
import numpy as np

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

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

print(np.amax(ans))

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

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

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

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

Solution (Python):
a,b = input().split()

A=int(a)
B=int(b)
print(max(A+B,A-B,A*B))

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    a, b = list(map(int, input().rstrip('\n').split()))
    print(max(a + b, a - b, a * b))


if __name__ == '__main__':
    slove()

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

Solution (Python):
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)

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

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

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

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

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

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

Solution (Python):


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

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

target = list()

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

print(max(target))

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

Solution (Python):
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)

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

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

Solution (Python):
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()

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

Solution (Python):
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])

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

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

Solution (Python):
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])

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

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

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

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

print(ans)

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

Solution (Python):
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)

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

Solution (Python):
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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


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

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

Solution (Python):
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))

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

print(max(c,d,e))

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

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

Solution (Python):
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

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

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

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

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

Solution (Python):
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)

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

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

Solution (Python):
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])

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
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))

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

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

Solution (Python):
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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
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))

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

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

Solution (Python):
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)

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

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

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

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

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

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

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

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

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

Solution (Python):
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)

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

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

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

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

ans = sorted(ans, reverse = True)

print(ans[0])

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

plus = a + b 

mai = a - b

kake = a * b 

print(max(plus,mai,kake))

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

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

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

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

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

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

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

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

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

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

Solution (Python):
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))

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

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

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

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

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

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

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

Solution (Python):
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()

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

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

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

Solution (Python):



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




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



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

Solution (Python):
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)))

Solution (Python):

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

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

print( max(c1,c2,c3) )

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

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

Solution (Python):
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])

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

Solution (Python):
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)

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

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

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

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

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

Solution (Python):
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]))

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

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


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

print(max(ans))

Solution (Python):
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])

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

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

print(max)

Solution (Python):


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

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

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

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

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

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

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

Solution (Python):

"""
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))

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

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

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

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

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

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

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

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

Solution (Python):
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)

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

Solution (Python):

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

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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

print(ans)

Solution (Python):

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

print("{}".format(max([A + B, A - B, A * B])))

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

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

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

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

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

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

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

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

v = []
a = A + B
b = A - B
c = A * B
v.append(a)
v.append(b)
v.append(c)

print(max(v))

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

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

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

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

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


if __name__ == '__main__':
  main()

Solution (Python):
a, b = map(int, input().split())
plus = a + b
minus = a - b
mul = a * b

print(max([plus, minus, mul]))

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

Solution (Python):
a, b = map(int, input().split())
if -100 <= a <= 100 and -100 <= b <= 100:
    plus = a + b
    minus = a - b
    multiple = a * b
    print(max(plus, minus, multiple))
else:
    print('a or b is invalid value.')

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

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

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

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

print(max(c))

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

Solution (Python):

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

max=A+B

now=A-B
if(max<now):
  max=now

now=A*B
if(max<now):
  max=now

print(max)

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


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

Solution (Python):
a,b=input().split()

a = int(a)
b = int(b)

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

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

Solution (Python):
a, b = input().split()

seki = int(a) * int(b)
sa = int(a) - int(b)
wa = int(a) + int(b)

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

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

Solution (Python):
a,b=input().split()

wa = int(a) + int(b)
sa = int(a) - int(b)
seki = int(a) * int(b)

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

Solution (Python):
def solve():
    a, b = map(int, input().split())
    nums = a + b, a - b, a * b
    print(max(nums))

solve()

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

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

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

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

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

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

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

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

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

Solution (Python):
A,B = map(int,input().split())
test1 = A+B
test2 = A-B
test3 = A*B
if test1 >= test2 and test1 >= test3:
  print(test1)
elif test2 >= test1 and test2 >= test3:
  print(test2)
elif test3 >= test1 and test3 >= test2:
  print(test3)

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

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

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

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

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

Solution (Python):
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)

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

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

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

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

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

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

print(max(tasu,hiku,kakeru))

Solution (Python):

MOD = 10 ** 9 + 7

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

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

print(ans)

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

Solution (Python):
a, b = map(int, input().split())
c = a + b
d = a - b
e = a * b
if c > d:
    if c > e:
        print(c)
    else:
        print(e)
else:
    if d > e:
        print(d)
    else:
        print(e)

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

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

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

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

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

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

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

Solution (Python):
a, b = input().split(' ')
a, b = int(a), int(b)

sum_val = a+b
sub_val = a-b
tim_val = a*b

print(max([sum_val, sub_val, tim_val]))

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

Solution (Python):
a, b = map(int, input().split())
p = a + b
m = a - b
d = a * b
print(max(p, m, d))

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

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

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

Solution (Python):

from sys import stdin




def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def _lf(): return list(map(float, stdin.readline().split()))
def _ls(): return stdin.readline().split()
def _i(): return int(stdin.readline())
def _f(): return float(stdin.readline())
def _s(): return stdin.readline()[:-1]


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

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

Solution (Python):
a, b = map(int, input().split())
s = a + b
t = a - b
u = a * b
x = sorted([s, t, u])
print(x[-1])

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

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

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

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

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

Solution (Python):
A, B = map(int, input().split())
if B > 0:
    if A * B > (A + B):
        val = A * B
    else:
        val = A + B
else:
    if A * B > (A - B):
        val = A * B
    else:
        val = A - B
        
print("%d"%val)

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B = MAP()

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

Solution (Python):
A, B = map(int, input().split())
if B > 0:
    if B == 1:
        val = A + B
    elif B >= 2:
        if A <= 1:
            val = A + B
        else:
            val = A * B
elif B == 0:
    if A > 0:
        val = A - B
    else:
        val = A * B
else:
    if A >= 0:
        val = A - B
    else:
        val = A * B
        
print("%d"%val)

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

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

mymax = -999

if A+B > mymax:
    mymax = A+B
if A-B > mymax:
    mymax = A-B
if A*B > mymax:
    mymax = A*B
print(mymax)

Solution (Python):
a,b = map(int,input().split())
ans1 = a+b
ans2 = a-b
ans3 = a*b
ans = max(ans1,ans2,ans3)
print(ans)

Solution (Python):
A, B = map(int, input().split())
val = A * B
if B > 0:
  val = (A + B) if (A + B) > val else val
else:
  val = (A - B) if (A - B) > val else val

print("%d"%val)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import numpy as np

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

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

Solution (Python):
A, B= [int(i) for i in input().split()]

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

Solution (Python):
import numpy as np

A,B = map(int,input().split())
ans = [A+B,A-B,A*B]
ans = np.sort(ans)
print (ans[-1])

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

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

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

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

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

Solution (Python):
a=list(map(int, input().split()))
b1=a[0]+a[1]
b2=a[0]-a[1]
b3=a[0]*a[1]
c=[b1,b2,b3]
ans=max(c)
print(ans)

Solution (Python):


import numpy as np

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


if __name__ == "__main__":
    resolve()

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

Solution (Python):
I=input()
A=int(I.split()[0])
B=int(I.split()[1])

R=[]

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

print(max(R))

Solution (Python):



import sys, os



def main():
    a, b = map(int, input().split())
    
    add = a + b
    sub = (a - b)
    mul = a * b
    max_val = max(add, sub, mul)
    print(max_val)

if __name__ == "__main__" :
    main()

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

Solution (Python):
innum = [int(x) for x in input().split()]

a = innum[0]
b = innum[1]

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

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

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

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

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

Solution (Python):
a, b = tuple(map(int, input().split()))
plus = a + b
minus = a - b
multi = a * b
print(max(plus, minus, multi))

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

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

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

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