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):
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)
elif d >= e:
    print(d)
else:
    print(e)

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

kigo = ["+","-","*"]
s_L = []
for val in kigo:
    tmp = eval(str(a) + val + str(b))
    s_L.append(tmp)
print(max(s_L))

Solution (Python):
def main():
    i = list(map(int, input().split()))
    a = i[0]
    b = i[1]

    if not(isinstance(a, int) and isinstance(b, int)):
        return
    if not(-100 <= a and a <= 100 and -100 <= b and b <= 100):
        return

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

    print(max(num))

if __name__ == "__main__":
    main()

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    a, b = map(int, input().split())
    print(max(a+b, a-b, a*b))


if __name__ == '__main__':
    main()

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    a, b = map(int, input().split())
    print(max(a+b, a-b, a*b))


if __name__ == '__main__':
    main()

Solution (Python):
A, B = [int(i) for i in 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())
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())
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

print(max(x, y, z))

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

Solution (Python):
a, b = map(int, input().split())
num1 = a + b
num2 = a - b
num3 = a * b

if num1 > num2:
    max = num1
else:
    max = num2

if max > num3:
    print(max)
else:
    print(num3)

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())
s = list()

s.append(a+b)
s.append(a-b)
s.append(a*b)
print(max(s))

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, raw_input().split())
num1 = a + b
num2 = a - b
num3 = a * b
if num1 < num2:
    num1 = num2
if num1 < num3:
    num1 = num3
print num1

Solution (Python):


a, b = map(int, raw_input().split())
num1 = a + b
num2 = a - b
num3 = a * b
if num1 < num2:
    num1 = num2
if num1 < num3:
    num1 = num3
print num1

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

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()))
x = int(A*B)
y = int(A+B)
z = int(A-B)
print(max(x,y,z))

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=max(a+b, a-b, a*b)
print(c)

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

Solution (Python):
l=list(map(int, input().split()))
A, B = l[0], l[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())
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)
else:
	print(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
sub = a-b
mul = a*b

if(add > sub and add > mul):
  print(add)
elif(sub > add and sub > mul):
  print(sub)
elif(mul > add and mul > sub):
  print(mul)
else:
  print(add)

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

max = 0
if a + b >= a - b:
    max = a + b
else:
    max = a - b

if max >= a * b:
    pass
else:
    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())
N_lis = []
N_lis.append(A+B)
N_lis.append(A*B)
N_lis.append(A-B)
print(max(N_lis))

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

Solution (Python):
A, B = map(int, input().split())
 
C = A+B
D = A-B
E = A*B
 
if C >= D and C >= E:
    print(C) 
elif D >= C and D >= E:
    print(D)
elif E >= C and E >= D:
    print(E)

Solution (Python):
A, B = map(int, input().split())
 
C = A+B
D = A-B
E = A*B
 
LIST = [C,D,E]
 
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())
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())
p = a + b
m = a - b
k = a * b
l = [p,m,k]
print(max(l))

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())
calc = [A+B, A-B, A*B]
print(max(calc))

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 = []
ans.append(A+B)
ans.append(A-B)
ans.append(A*B)
print(max(ans))

Solution (Python):

import sys










def main():
    a, b = [int(x) for x in sys.stdin.readline().split()]
    ans = max(a+b, a-b, a*b)
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a, b = map(int, input().split())
sum = a+b
dif = a-b
pro = a*b
ans = [sum, dif, pro]
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())
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):
ab = list(map(int,input().split()))

a = ab[0]
b = ab[1]

s = a+b
r = a-b
p = a*b

print(max([s, r, p]))

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

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

ans = 0

addition = a + b
subtraction = a - b
multiplication = a * b

if addition < subtraction:
  if multiplication < subtraction:
    ans = subtraction
  else:
    ans = multiplication
else:
  if multiplication < addition:
    ans = addition
  else:
    ans = multiplication

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):
i = list(map(int,input().split()))
l = [i[0]+i[1], i[0]-i[1], i[0]*i[1]]
print(max(l))

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

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

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


def solve():
    plus = a + b
    minus = a - b
    multi = a * b

    return max(plus, minus, multi)


print(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):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b



def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2



def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)



def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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


if __name__ == '__main__':
    main()

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):
i = list(map(int, input().split()))
print(max(i[0]+i[1],i[0]-i[1],i[0]*i[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())
res = max(a + b, a - b, a * b)
print(res)

Solution (Python):
import sys
input = sys.stdin.readline
def print_ans(A, B):
    """Test Case
    >>> print_ans(-13, 3)
    -10
    >>> print_ans(1, -33)
    34
    >>> print_ans(13, 3)
    39
    """
    print(max(max(A + B, A - B), A * B))

if __name__ == '__main__':
    A, B = map(int,input().rstrip().split())
    print_ans(A, B)

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

Solution (Python):
import math
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())
box = [a*b,a-b,a+b]
print(max(box))

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 = [int(i) for i in 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())
print(max([A+B, A-B, A*B]))

Solution (Python):
import sys
input = sys.stdin.readline

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

tmp = -1000
if a+b > tmp:
    tmp = a+b
if a-b > tmp:
    tmp = a-b
if a*b > tmp:
    tmp = a*b

print(tmp)

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

l = [0]*3

l[0] = a+b
l[1] = a-b
l[2] = 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 = list(map(int,input().split()))
ans = max([A+B,A-B,A*B])
print(ans)

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

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)

Solution (Python):



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

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

if __name__ == '__main__':
    main()

Solution (Python):

a, b = [int(s) for s 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 = 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())

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

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

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

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

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 = list(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())
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())
L = [A+B,A-B,A*B]
L.sort()
print(L[2])

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

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())
l = [a+b, a-b, 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(max(a+b,a-b,a*b))

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

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

rist = [ A+B , A-B , A*B]

print(max(rist))

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

Solution (Python):
def chmax(x, y):
    if x < y:
        return y
    else:
        return x

a, b = map(int, input().split())
res = a + b
res = chmax(res, a-b)
res = chmax(res, a*b)

print(res)

Solution (Python):
a,b = list(map(int,(input().split())))
List = [a+b,a-b,a*b]
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())

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

print(max(max(wa,gen),max(seki,gen)))

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

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

Solution (Python):


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

if __name__ == "__main__":
    main()

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


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

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

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

max_list = []
max_list.append(ab[0] + ab[1])
max_list.append(ab[0] - ab[1])
max_list.append(ab[0] * ab[1])
max_list.sort()
print(max_list[-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(" "))
a=A+B
b=A-B
c=A*B
d=[a,b,c]
print(max(d))

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())
add = a + b
sub = a - b
mul = a * b
callist = [add, sub, mul]
print(max(callist))

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

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())
res = A + B
res = max(res, A - B, A * B)
print(res)

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

Solution (Python):
def update_max_num(temp, max_num):
    if temp>max_num:
        max_num=temp
    return max_num
    
a,b = input().split()
a=int(a)
b=int(b)

max_num=a+b
temp=a-b
max_num=update_max_num(temp, max_num)
temp=a*b
max_num=update_max_num(temp, max_num)

print(max_num)

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())
answer = max(A+B, A-B, A*B)

print(answer)

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

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())
print(max(a+b,a-b,a*b))

Solution (Python):
AB=input().split()
A,B=int(AB[0]),int(AB[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):
a, b = map(int, input().split())

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

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

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


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

"""
print('tashizan',tasu)
print('hiki',hiku)
print('kake',kakeru)
"""


if tasu >= hiku and tasu >= kakeru:
    print(tasu)
elif hiku >= tasu and hiku >= kakeru:
    print(hiku)
else:
    print(kakeru)


"""
for i in range(3):
    if tasu > hiku:
        if tasu > kakeru:
            print(tasu)
    elif hiku > tasu:
        if hiku > kakeru:
            print(hiku)
    elif kakeru > tasu:
        if kakeru > hiku:
"""

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(' ')]

-100<=A
B<=100

x = A + B
y = A - B
z = A * B

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

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 = (int(x) for x 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())
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):
tmp = list(map(int, input().split()))
a = tmp[0]
b = tmp[1]

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

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

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

Solution (Python):
nums = [int(e) for e in input().split()]

a = (nums[0] + nums[1])
b = (nums[0] - nums[1])
c = (nums[0] * nums[1])
if (a) >= (b) and (a) >= (c):
    print(a)
elif (b) >= (a) and (b) >= (c):
    print(b)
else:
    print(c)

Solution (Python):
a,b = map(int,input().split())
def fn(a,b):
    x = a + b
    y = a - b
    z = a * b
    l = [x,y,z]
    return l
print(max(fn(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):
"""
author : halo2halo
date : 19,Oct,2019
"""

import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

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

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

Solution (Python):
def t(a, b):
    return max(a + b, a - b, a * b)


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

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

Solution (Python):
from sys import stdin, exit

input = stdin.readline
lmi = lambda: list(map(int, input().split()))
mi = lambda: map(int, input().split())
si = lambda: input().strip('\n')
ssi = lambda: input().strip('\n').split()

a, b = mi()
x = a+b
y = a*b
z = a-b
print(max(x, y, z))

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

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

Solution (Python):
if __name__ == '__main__':

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

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

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

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

Solution (Python):
num = input().split(" ")
a = int(num[0])
b = int(num[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):
a, b = map(int,input().split())
print(max(a+b,a-b,a*b))

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

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
numbers =input().rstrip().split(" ")
a =int(numbers[0])
b =int(numbers[1])
values =[0,0,0]
values[0]=a+b
values[1]=a-b
values[2]=a*b

ranking =sorted(values ,reverse=True)

print(ranking[0])

Solution (Python):
A, B = map(int, input().split())
ans = A + B
if A - B > ans:
  ans = A - B
if A * B > ans:
  ans = 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())

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
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

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

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

abp = a + b
abm = a - b
abmp = a * b

res = [abp, abm, abmp]

res.sort()

print(res[-1])

Solution (Python):

import sys
args = sys.argv
if len(args) == 2:
  from IPython import embed
  em = True
else:
  em = False
input = sys.stdin.readline
A, B = map(int, input().split())
if em: sys.stdin = open('/dev/tty')
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())
x=a+b
y=a-b
z=a*b
list=[x,y,z]
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())
a = []
a.append(A+B)
a.append(A-B)
a.append(A*B)
print(max(a))

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())
ans = []
ans.append(a+b)
ans.append(a-b)
ans.append(a*b)

print(max(ans))

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

Solution (Python):
a,b = map(int,input().strip().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())

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

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

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

sum = a + b
min = a - b
mul = a * b

print(max(sum,min,mul))

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

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()))
p = int(A + B)
m = int(A - B)
c = int(A * B)
s = [p,m,c]
print(max(s))

Solution (Python):
A, B = map(int, input().split())
C = A+B
D = A-B
E = A*B
F =-10000

if C >= D:
  F = C
  if E >= F:
    F = E
elif C <= D:
  F = D
  if F <= E:
    F = E

print(F)

Solution (Python):
if __name__ == "__main__":
    a, b = map(int, input().split())
    s = a + b; d = a - b; p = a * b
    print(max([s, d, p]))

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

Solution (Python):
N = input().split()
N_1 = int(N[0])
N_2 = int(N[1])

l = []
l.append(N_1 + N_2)
l.append(N_1 - N_2)
l.append(N_1 * N_2)
ans = max(l)

print(ans)

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

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

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

Solution (Python):

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


if __name__ == "__main__":
    main()

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

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

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

s = A + B
d = A - B
m = A * B

print(max(s, d, m))

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

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

Solution (Python):
str_list = input().split(' ')
int_list = [int(x) for x in str_list]

A, B = int_list[0], int_list[1]

c = max(A+B, A-B)
c = max(c, 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())

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

print(max(wa,sa,seki))

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

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

Solution (Python):
a=input()
A=a.split()
B=[]
B.append(int(A[0])+int(A[1]))
B.append(int(A[0])-int(A[1]))
B.append(int(A[0])*int(A[1]))
B.sort(reverse=True)
print(B[0])

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

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())
c = a + b
d = a - b
e = a * b

if c >= d:
    if e >= c:
        print(e)
    else:
        print(c)
else:
    if e >= d:
        print(e)
    else:
        print(d)

Solution (Python):
A,B = map(int,input().split())
if B >= 0:
    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)

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())
add = a + b
sub = a - b
mul = a * b
print(max(add,sub,mul))

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())
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):
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):
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 = tuple(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
print(max(X,Y,Z))

Solution (Python):
a, b = input().split()
a = int(a)
b = int(b)
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())

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