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 math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    a, b = LI()
    print(max(a + b, a - b, a * b))

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

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

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

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

Solution (Python):
import sys
import math
import bisect

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






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


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





A,B = inputIL()

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 i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

a,b=i2()
s=max(a+b,a-b,a*b)
print(s)

Solution (Python):


from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    a,b = mi()
    print(max(a+b,a-b,a*b))

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

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

if __name__ == '__main__':

    ABC_137_A()

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


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

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

Solution (Python):

if __name__ == "__main__":
    A, B = [int(a) for a 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 = 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())

calc=[]

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

print(max(calc))

Solution (Python):


import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))


def resolve():
    a,b=pin()
    print(max(a+b,a-b,a*b))

resolve()

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):
import sys, heapq

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

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

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

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

add = A + B
dec = A - B
rid = A * B

print(max(add, dec, rid))

Solution (Python):
a,b=map(int,input().split())
pl = a+b
di = a-b
mu = a*b
if pl>=di and pl>=mu:
    print(pl)
elif di>=pl and di>=mu:
    print(di)
else:
    print(mu)

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

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

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):
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(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):
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())
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())
p, m, a = a+b, a-b, a*b
print(max([p, m, a]))

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

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

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

plus = A + B
minus = A - B
cross = A * B
test = [plus, minus, cross]
print(max(test))

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

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

if n >= A * B:
    print(n)
else:
    print(A * B)

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

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

Solution (Python):

import sys
input = sys.stdin.readline
A,B = (int(x) for x in input().split())

sum_ab      =A+B
differ_ab   =A-B
product_ab  =A*B
print(max(sum_ab,differ_ab,product_ab))

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(_) for _ in input().split()]
print(max(a+b,a-b,a*b))

Solution (Python):


def main():
    A, B = map(int, open(0).read().split())
    print(max(A + B, A - B, A*B))


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

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
q = a*b
r = a-b
print(max(p,q,r))

Solution (Python):
n,m = (int(x) for x in input().split())
ls = list()
ls.append(n+m)
ls.append(n-m)
ls.append(n*m)
print(max(ls))

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

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

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

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())
print(max(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
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd 
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) 


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

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

Solution (Python):
x = input().split()

n = int(x[0])

m = int(x[1])

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

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

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

print(max(wa, sa, se))

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

Solution (Python):
A, B = map(str, input().split())
operator= ["+", "-", "*"]
ans = []

for i in operator:
    ans.append(eval(A+i+B))

print(max(ans))

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

Solution (Python):
x = input().split()
a = float(x[0])
b = float(x[1])
la = len(x[0])
lb = len(x[1])
if a < 0 and b > 0:
  a = int(x[0][1:la])
  b = int(b)
  p = - a + b
  m = - a - b
  k = - a * b
elif b < 0 and a > 0:
  a = int(a)
  b = int(x[1][1:lb])
  p = a - b
  m = a + b
  k = a * - b
elif a< 0 and b < 0:
  a = int(x[0][1:la])
  b = int(x[1][1:lb])
  p = - a - b
  m = - a + b
  k = a * b
else:
  a = int(x[0])
  b = int(x[1])
  p = a + b
  m = a - b
  k = a * b
if p >= m and p >= k:
  print(p)
elif m >= p and m >= k:
  print(m)
elif k >= p and k >= m:
  print(k)

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 = [int(x) for x in input().split()]
ans = max([a + b, a - b, a * b])
print(ans)

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:
  print(a+b)
else:
  print(a-b)

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):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

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

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

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

print(max(mul,sub,add))

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

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

print(max(x+y,x-y,x*y))

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

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

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

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

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

Solution (Python):


import sys



















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    a, b = mi()
    print(max(a+b, a-b, a*b))

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):


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

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

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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
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 = list(map(int, input().split()))
ad = a[0] + a[1]
sb = a[0] - a[1]
mp = a[0] * a[1]
print(max([ad, sb, mp]))

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().rstrip().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
diff = a-b
mul = a*b
print(max(max(sum, diff), mul))

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):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
S = input().rstrip()
N = int(input())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

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

print(max(t, m, k))

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
icase=0
if icase==0:
    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)
print(max(C,D))

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

Solution (Python):
K, N = map(int, input().split())

X = K+N
Y = K-N
Z = K*N

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())
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())
T = A+B
H = A-B
K = A*B
A=[]
A.append(T)
A.append(H)
A.append(K)

print(max(A))

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

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

print(max(tasu,hiku,kake))

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())
print(str(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 = 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=input().split()
a = int(a)
b = int(b)
ad = a+b
minus = a-b
cross = a*b
lis = [ad, minus, cross]
print(max(lis))

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
sa = A-B
seki = A*B
 
print(max(max(wa,sa), max(sa,seki)))

Solution (Python):
a, b= input().split()
a, b= int(a), int(b)
eq1= a+b
eq2= a-b
eq3= a*b

maior= max(eq1, eq2, eq3)
print(maior)

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]
ans = max(list)

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

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

Solution (Python):



from math import *
from copy import *
from string import *				
from random import *				
from bisect import *				
from sys import stdin				
from sys import maxsize
from operator import *				
from itertools import *
from collections import Counter		
from collections import defaultdict 

'''

'''

def solve(l):
	n = len(l)
	

a,b = list(map(int, stdin.readline().rstrip().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(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())

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 = [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())
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 = int(a+b)
y = int(a-b)
z = int(a*b)

l = []
l.append(int(x))
l.append(int(y))
l.append(int(z))
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):
n, m = map(int, input().split())
print(max(n + m, n - m, n * m))

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

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

A,B=nm()
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 os, sys, re, math

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

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

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

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

Solution (Python):

A, B = [int(s) for s in input().split()]
print(max(A + B, A - B, A * B))

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

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

X = A + B
Y = A - B
Z = A * B
print(max(max(X,Y),Z))

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

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

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

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

print(max(arr))

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):
def q1():
    """ A - +-x """
    A, B = (int(i) for i in input().split())
    print(max([A+B, A-B, A*B]))

    
if __name__ == '__main__':
    q1()

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

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

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

Solution (Python):
A, B = map(int, input().split())
N = [ A+B, A-B, A*B ]
print(max(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):
data = input()
data = data.split(' ')

A = int(data[0])
B = int(data[1])

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

print(answer)