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

Solution (Python):


if __name__ == "__main__":
    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())
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())
plus=A+B
minus=A-B
product=A*B
print("{}".format(max(plus,minus,product)))

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

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

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

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

Solution (Python):


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

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


if __name__ == "__main__":
    main()

Solution (Python):
import logging

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


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

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

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

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

Solution (Python):
test = input().split(" ")
a = int(test[0])
b = int(test[1])
answer = a + b
diff = a - b
product = a * b
if answer < diff:
  answer = diff
if answer < product:
  answer = product
print(answer)

Solution (Python):
s = list(map(int,input().split()))
t = max(s[0]+s[1],s[0]-s[1],s[0]*s[1])
print(t)
'''
print('A+B={0},A-B={1},A*B={2},A/B={3}の中で最大の数{4}はです'.format(s[0]+s[1],s[0]-s[1],s[0]*s[1],s[0]/s[1],t))
'''

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(a) for a in 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)

Solution (Python):
def calc(a,b):
  return [a+b, a-b, a*b]

s = list(map(int, input().split()))
res = calc(s[0], s[1])
print(max(res))

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 = 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 = input().split(' ')
A = int(A)
B = int(B)

plus = A + B
minus = A - B
product = A * B


print(max(plus,minus,product))

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 = 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 = list(map(int, input().split()))
print (max(A + B, A - B, A * B))

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

Solution (Python):
nums = list(map(int,input().split()))
sum = nums[0] + nums[1]
sub = nums[0] - nums[1]
mul = nums[0] * nums[1]
if sum >= sub and sum >= mul:
  print (sum)
elif sub >= sum and sub >= mul:
  print (sub)
else:
  print (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=[]
l.append(a+b)
l.append(a-b)
l.append(a*b)
print(max(l))

Solution (Python):


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

Solution (Python):


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

tasi = A+B
hiki = A-B
kake = A*B

ml=[tasi,hiki,kake]
mx=max(ml)


print('{}'.format(mx))

Solution (Python):
calc_result = []
result = input().split()
n1, n2 = int(result[0]), int(result[1])
calc_result.append(n1 + n2)
calc_result.append(n1 - n2)
calc_result.append(n1 * n2)
print(max(calc_result))

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

Solution (Python):
import math
import sys
import collections



def getdict(n):
    d = {}
    if type(n) is list:
        for i in n:
            if i in d:
                d[i] += 1
            else:
                d[i] = 1
    else:
        for i in range(n):
            t = ii()
            if t in d:
                d[t] += 1
            else:
                d[t] = 1
    return d
def cdiv(n, k): return n // k + (n % k != 0)
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a*b) // math.gcd(a, b)

a, b = mi()
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)
if a-b>a+b and a-b>a*b:
        print(a-b)
if a*b>a-b and a*b>a+b:
        print(a*b)

Solution (Python):
from sys import stdin
def ii(): return int(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def li(): return list(mi())
a, b=mi()
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(' '))
ans = max(a+b, a-b, a*b)
print(ans)

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

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

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

print(max(li))

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

ad=a+b
su=a-b
mu=a*b

print(max(ad,su,mu))

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

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

Solution (Python):

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

X = A + B
Y = A - B
Z = A * B

if X >= Y and X >= Z:
    print(X)
elif Y >= X and Y >= Z:
    print(Y)
elif Z >= X and Z >= Y:
    print(Z)

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

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

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

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

print(max(lst))

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

Solution (Python):

a, b = map(int,input().split())
c1 = a+b
c2 = a-b
c3 = a*b
if c1>c2 and c1>c3:
	print(c1)
elif c2>c3:
	print(c2)
else:
	print(c3)

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

Solution (Python):

S = input().split()
X = int(S[0])+int(S[1])
Y = int(S[0])-int(S[1])
Z = int(S[0])*int(S[1])
if X >= Y:
    if X >= Z:
        print(X)
    else:
        print(Z)
else:
    if Y >= Z:
        print(Y)
    else:
        print(Z)

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)

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

print(max(c,d,e))

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

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


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

    ans = solve(a, b)
    print(ans)


main()

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

Solution (Python):

s=list(map(int, input().split()))
add=s[0]+s[1]
sub=s[0]-s[1]
mul=s[0]*s[1]
print(max([add,sub,mul]))

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):
def main():
     a,b=map(int,input().split())
     ans=max(a+b,a-b)
     ans=max(ans,a*b)
     print(ans)
     
if __name__ == '__main__':
     main()

Solution (Python):
import numpy as np

A,B = map(int,input().split())
C = A+B
D = A-B
E = A*B
list_1 = [C,D,E]
list_1.sort()
print(list_1[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())

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

tmp = 0
if c1 > c2 :
  tmp = c1
else :
  tmp = c2
  
if c3 > tmp :
  tmp = c3

print(tmp)

Solution (Python):

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

Solution (Python):



def solve(arg: str) -> str:
    a, b = map(int, arg.split())
    ans = max((a+b), (a-b), (a*b))
    return str(ans)


if __name__ == "__main__":
    print(solve(input()))

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

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
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 = 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):
s=list(map(int,input().split()))
a=0
b=0
c=0
a=s[0]-s[1]
list=[]
b=s[0]+s[1]
c=s[0]*s[1]
list.append(a)
list.append(b)
list.append(c)
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())
s = max(a+b,a-b,a*b)
print(s)

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

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

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

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

print(max(calc_list))

Solution (Python):
A,B = map(int, input().split())
cal = [A+B, A-B, A*B]
ans = max(cal)
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):
values = input()
s = [int(i) for i in values.split()]
print(max(sum(s), s[0]-s[1], s[0]*s[1]))

Solution (Python):

number = list(map(int,input().split()))
list = [0,0,0]
list[0] = number[0]+number[1]
list[1] = number[0]-number[1]
list[2] = number[0]*number[1]
print(max(list))

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

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

Solution (Python):
a,b = map(int,input().split())
ab_list = list()
ab_list.append(a + b)
ab_list.append(a - b)
ab_list.append(a * b)
print(max(ab_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):
x = input()

A = int(x.split()[0])
B = int(x.split()[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):
import sys

S = input().split()
A = int(S[0])
B = int(S[1])
maxval = -sys.maxsize

add = A + B
diff = A - B
mul = A * B

if add > maxval:
    maxval = add
if diff > maxval:
    maxval = diff
if mul > maxval:
    maxval = mul

print(maxval)

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):
num = input().split()
n1 = int(num[0])
n2 = int(num[1])
plus = n1 + n2
minus = n1 - n2
mul = n1 * n2
max = max(max(plus,minus), mul)
print(max)

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

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

c = list(map(int,input().split()))


a = c[0]
b=c[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):
intlist= [i for i in input().split()]
a = int(intlist[0])
b = int(intlist[1])

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

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

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

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

print(ans)

Solution (Python):
import sys

a, b = map(int, input().split())
 
sum = a + b
minus = a - b
sub = a * b
 
if (sum - minus) > 0:
  if (sum - sub) > 0:
    print(sum)
  else:
    print(sub)
else:
  if (minus - sub) > 0:
    print(minus)
  else:
    print(sub)

Solution (Python):

inline = list(map(int,input().split(" ")))
mx = inline[0] + inline[1]
mx = max(inline[0] - inline[1],mx)
mx = max(inline[0] * inline[1],mx)
print(mx)

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

Solution (Python):
a, b = list(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('{}'.format(max(a+b, a-b, a*b)))

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

max_num = a + b
if max_num < a - b:
    max_num = a - b
if max_num < a * b:
    max_num = 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())
x = a + b
y = a - b
z = a * b
i = []
i.append(x)
i.append(y)
i.append(z)
i.sort()
print(i[-1])

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

Solution (Python):




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



print("{}".format(max(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,max(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())

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

print(max(tasu,kakeru,hiku))

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 = (int(i) for i in input().split())  
sum=a+b
dif=a-b
mul=a*b
 
 
if sum > dif:
    if mul>sum:
        print('{}'.format(mul))
    else:
        print('{}'.format(sum))
else:
    if mul>dif:
        print('{}'.format(mul))
    else:
        print('{}'.format(dif))

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())
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 solve(A: int, B: int):
    sum = A + B
    sub = A - B
    mul = A * B

    max = sum if sum > sub else sub
    max = max if max > mul else mul

    print(max)
    return 



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(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 = list(map(int, input().split()))
print(max(A+B,A-B,A*B))

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 and 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 = input().split()

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


sum = a + b
dif = a - b
pro = a * b


def greatest(a, b, c):
    if a > b:
        if a > c:
            return a
        else:
            return c
    else:
        if b > c:
            return b
        else:
            return c


print(greatest(sum, dif, pro))

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

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

N=A+B
M=A-B
B=A*B

saru=[N,M,B]
print(max(saru))

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

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(" "))
s=a+b 
s1=a-b
s2=a*b
if(s1>=s and s1>=s2):
  print(s1)
elif(s>=s1 and s>=s2):
  print(s)
else:
  print(s2)

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

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(" ")))
b=a[0]+a[1]
c=a[0]-a[1]
d=a[0]*a[1]
print(max(b,c,d))

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

mymax = -99999

if mymax < A + B:
  mymax = A + B

if mymax < A - B:
  mymax = A - B

if mymax < A * B:
  mymax = A * B


print(mymax)

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())
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):
import sys
input=sys.stdin.readline
a,b=map(int,input().split())
ans=max(a+b,a-b,a*b)
print(ans)

Solution (Python):

import bisect
import collections
import itertools


def getint(): return int(input())
def getints(): return list(map(int, input().split()))
def getint2d(rows): return [getints() for _ in range(rows)]
def getgrid(rows): return [input() for _ in range(rows)]
def array1d(n, value): return [value for _ in range(n)]
def array2d(n, m, value): return [array1d(m, value) for _ in range(n)]

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

Solution (Python):
num1,num2 = map(int, input().split())

plus = num1 + num2
minus = num1 - num2
times = num1 * num2

total = [plus,minus,times]

print(max(total))

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

Solution (Python):
import math
from itertools import accumulate


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

array = list(map(int, input().split()))

plus = array[0] + array[1]
minus = array[0] - array[1]
product = array[0] * array[1]

print(max(plus, minus, product))

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

Solution (Python):



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

count = 0
ans = a + b
mi= a - b
x = a * b

ans = max(ans, mi)
ans = max(ans, x)

print(ans)

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

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

print(R)

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

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

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

print(ans)

Solution (Python):
num1,num2 = map(int,input().split())
 
num3 = num1 + num2
num4 = num1 - num2
num5 = num1 * num2
num6 = [num3, num4, num5]
 
print(max(num6))

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
if c<a-b :
  c=a-b
if c<a*b :
  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 = 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):
a,b=map(int,input().split())




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

Solution (Python):
num1,num2 = map(int, input().split())

plus = num1 + num2
minus = num1 - num2
times = num1 * num2

list = [plus,minus,times]

print(max(list))

Solution (Python):
i = list(map(int, input().split()))
a=i[0]+i[1]
b=i[0]-i[1]
c=i[0]*i[1]
if a>=b and a>=c:
  print(a)
elif b>=a and b>=c:
  print(b)
else:
  print(c)

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

x = a[0] + a[1]
y = a[0] - a[1]
z = a[0] * a[1]

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

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

x = a[0] + a[1]
y = a[0] - a[1]
z = a[0] * a[1]

if x >= y and x >= z:
  print(x)
elif y >= x and y >= z:
  print(y)
else:
  print(z)

Solution (Python):
def solve(a, b):
    return max([a+b, a-b, a*b])

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

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

if plus > minus:
  maximum = plus if plus > multi else multi
else:
  maximum = minus if minus > multi else multi
  
print('{}'.format(maximum))

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())
if b > 0:
    if (a + b) > (a * b):
        print(a + b)
    else:
        print(a * b)
elif b == 0:
    print(a)
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 = 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, str(input()).split())

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

print(output)

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):
def max(x,y):
    if (x > y):
        return x
    else :
        return y
   
ab = input().split(' ')
a = int(ab[0])
b = int(ab[1])

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

Solution (Python):
a, b = [int(i) for i in input().split(' ')]
result = [a+b, a-b, 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 = 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())
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):
def main(A,B):
    if A >= -100 and B <= 100:
        mul = A*B
        plus = A+B
        minus = A-B
        num = [mul,plus,minus]
    return max(num)

if __name__ == '__main__':
    s = list(map(int, input().split()))
    huga = main(s[0], s[1])
    print(huga)

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

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

Solution (Python):


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

if __name__ == "__main__":
    solve()

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


X = A + B
Y = A - B
Z = A * B

print(max(X, Y, Z))

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

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

if a-b > a+b:
    if a-b > a*b:
        print(a-b)
    else:
        print(a*b)
elif a*b > a+b:
    if a*b > a-b:
        print(a*b)
    else:
        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):
d = raw_input().split()
a, b = d[0], d[1]
operators = ["+", "-", "*"]
current = None
soFar = None
for i in range(len(operators)):
    current = eval(a + operators[i] + b)
    soFar = max(current, soFar)
print(soFar)

Solution (Python):
A, B = map(int, input().split())
list = [A+B,A-B,A*B]
list.sort(reverse=True)
print(list[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())
P=A+B
M=A-B
K=A*B
print(max(P,M,K))

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

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

a = i[0]
b = i[1]

plus = a + b
minus = a - b
add = a * b

list = [plus, minus, add]

flag = True
for l in list :
    if flag :
        box = l
        flag = False
    else :
        if l >= box :
            box = l
print(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):

if __name__ == "__main__":
    A = list(map(int,input().split()))
    B = A[1]
    A = A[0]
    ans = [0] * 3
    ans[0] = A + B
    ans[1] = A - B
    ans[2] = A * B
    print(max(ans))

Solution (Python):
import sys
import bisect
input = sys.stdin.readline
 
def main():
    x,y = map(int,input().split())	
    ans=max(x+y,x-y,x*y)
    print(ans)
    
main()

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

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

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

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)

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 = [int(i) for i in 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):
def solve(string):
    a, b = map(int, string.split())
    return str(max(a + b, a - b, a * b))


if __name__ == '__main__':
    print(solve(input()))

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

kotae=max(a,b,c)


print(kotae)

Solution (Python):
A, B = [int(_) for _ in 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())
n = a+b
m = a-b
l = a*b

a_b = [n,m,l]
print(max(a_b))

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

Solution (Python):
print( *[ max([x[0]+x[1],x[0]-x[1],x[0]*x[1]]) for x in [[int(i) for i in input().split()]]])

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

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

Solution (Python):
import math, heapq
INF = float("inf")
MOD = int(1e9 + 7)

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

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