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




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

Solution (Python):
A, B = map(int, 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())
print(max(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=[]
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):

import sys

def log(*args, **kwargs):
    print(*args, file=sys.stderr)

log("hogehoge")

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

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

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

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

Solution (Python):
import sys
input=sys.stdin.readline
n,k=map(int,input().split())
print(max(n+k,n-k,n*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())

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(A: int, B: int):
    print(max(A+B, A-B, A*B))
    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=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())
w=a+b
k=a*b
h=a-b
ans=max(w,k,h)
print(ans)

Solution (Python):

import sys
row = sys.stdin.readline
def read_ints(row):
    return list(map(int, row().split()))
  
A,B = read_ints(row)
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())
A = [a+b, a-b, a*b]
print(max(A))

Solution (Python):
A,B=map(int,input().split())
C=A+B
D=A-B
E=A*B
ans=max(C,D,E)
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())
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 = [int(x) for x in input().split()]

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

lst = [plus, minus, multi]

print(max(lst))

Solution (Python):
a,b=map(int,input().split())
l=[]
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())
A=a+b
B=a-b
C=a*b
if A>=B and A>=C:
  print(A)
elif B>=A and B>=C:
  print(B)
else:
  print(C)

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

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

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

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

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

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 = sorted([ A+B, A-B, A*B], reverse = True)
print(C[0])

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

ans1 = A+B
ans2 = A-B
ans3 = A*B

if ans1>=ans2 and ans1>=ans3:
    print(ans1)
elif ans2>=ans1 and ans2>=ans3:
    print(ans2)
elif ans3>=ans1 and ans3>=ans2:
    print(ans3)

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

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

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

Solution (Python):
import numpy as np
list=input().split()

for i in range(2):
    if i==0:
        A=int(list[i])
    if i==1:
        B=int(list[i])

sum=A+B
sub=A-B
product=A*B

if sum>sub:
    if product>sum:
        print(int(product))
    else:
        print(sum)
else:
    if product>sub:
        print(int(product))
    else:
        print(int(sub))

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

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

if sum >= sub and sum >= mul:
    print(sum)
elif sub >= sum and sub >= mul:
    print(sub)
else:
    print(mul)

Solution (Python):
TANO,C=map(int,input().split())
HARD=TANO+C
CORE=TANO-C
print(max(HARD,CORE,TANO*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())

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

s.sort()
print(s[2])

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

Solution (Python):
import numpy as np
a,b=map(int,input().split())
print(np.max((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 LI():
  return [int(s) for s in input().split()]
 
A,B = LI()
 
print(max([A+B,A-B,int(A*B)]))

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

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

print(max(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]
L.sort(reverse=True)
print(L[0])

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

    print(max(x,y,z))

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

h = a * b
j = a + b
k = a - b

l = [h, j, k]
l.sort()

print(l[-1])

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

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):
import sys
import math
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y

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

Solution (Python):
"""
author : halo2halo
date : 11, Jan, 2020
"""

import sys

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

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

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

Solution (Python):
inputA,inputB =map(int, input().split(' '))


plus = 0
mainus = 0
cross = 0

plus = inputA + inputB
mainus = inputA -inputB
cross = inputA * inputB

if plus > mainus:
    if plus > cross:
        print(plus)
    else:
        print(cross)
elif mainus > cross:
    print(mainus)
else:
    print(cross)

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

Sum = A + B
Sub = A - B
Mult = A * B

print(max(Sum,Sub,Mult))

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

Solution (Python):
num = input().split()
wa = int(num[0]) + int(num[1])
sa = int(num[0]) - int(num[1])
seki =  int(num[0]) * int(num[1])
if wa >= sa:
  if wa >= seki:
    print(wa)
  else:
    print(seki)
else:
  if sa >= seki:
    print(sa)
  else:
    print(seki)

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

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

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

cResult =[]

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

cSorted = sorted(cResult,reverse=True)

print(cSorted[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())
l = sorted([A+B,A-B,A*B])
print(l[2])

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

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

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

print(d)

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

s = (A + B)
t = (A - B)
u = (A * B)

print(max(s, t, u))

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

if A == 0 and B == 0:
    print('0')

elif A == 1 and B >= 0:
    print(A + B)

elif A >= 0 and B == 1:
    print(A + B)

elif A > 0 and B > 0:
    print(A * B)

elif A < 0 and B < 0:
    print(A * B)

elif A <= 0 and B >= 0:
    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())
x = [(a + b), (a - b), (a * b)]
print(max(x))

Solution (Python):
a,b = (int(x) for x in input().split())
ans1 = a+b
ans2 = a-b
ans3 = a*b

if ans1 > ans2:
    if ans1 > ans3:
        print(ans1)
    else:
        print(ans3)

else:
    if ans2 > ans3:
        print(ans2)
    else:
        print(ans3)

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

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

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

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())
plus = A + B
minus = A - B
mult = A * B
ans = max(plus, minus, mult)
print(ans)

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

Solution (Python):
n = input()
n_list = n.split(" ")

a = int(n_list[0])
b = int(n_list[1])

p = a + b
mi = a - b
mu = a * b

if p >= mi and p >= mu:
    print(p)
elif mi >= p and mi >= mu:
    print(mi)
elif mu >= p and mu >=mi:
    print(mu)

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
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 pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    a,b = LI()

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


print(main())

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b=INTM()
    print(max(a+b,a-b,a*b))
if __name__ == '__main__':
    do()

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

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

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

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

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

a = A+B
b = A-B
c = A*B

if a >= b and a >= c:
    print(a)
elif b >= a and b >= c:
    print(b)
elif c >= a and c >= b:
    print(c)

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

_sum = A + B
_sub = A - B
_mul = A * B

_list = [_sum,_sub,_mul]

print(max(_list))

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

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

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

if __name__ == '__main__':
    print(main())

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

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

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

if x > y:
  if x>z:
    ans = x
  else:
    ans = z
else:
  if y>z:
    ans = y
  else:
    ans = z

print(ans)

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

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

if x > y:
  if x>z:
    ans = x
  else:
    ans = z
else:
  if y>z:
    ans = y
  else:
    ans = z

print(ans)

Solution (Python):
A,B=map(int, input().split())
s=[]
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())
plus = a+b
minus = a-b
times = a*b
print(max(plus, minus, 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 = 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()))
box = []
box.append(a+b)
box.append(a-b)
box.append(a*b)
print(max(box))

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

A = a + b
B = a - b
C = a * b

print(max([A, B, C]))

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

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

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

Solution (Python):
from sys import stdin
 
a,b = [int(x) for x in stdin.readline().rstrip().split()]
 
arr =[]
 
arr.append(a+b)
arr.append(a-b)
arr.append(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 = [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):
a, b = map(int, input().split())
value = [a + b , a - b , a * b ]
print(max(value))

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

Solution (Python):

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

p = b + c
m = b - c
k = b * c

if p > m:
    if p > k:
        print(p)
    else:
        print(k)
elif k > m:
    print(k)
else:
    print(m)

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    a,b=map(int,input().split())
    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 = 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())
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):
nums=[int(i) for i in input().split()]

p=nums[0]+nums[1]
m=nums[0]-nums[1]
x=nums[0]*nums[1]

print(max(p,m,x))

Solution (Python):
A, B = map(int, input().split())
c = A + B
d = A - B
e = A * B
f = [c, d, e]
maxvalue = c
for i in range(len(f)):
    if f[i] > maxvalue:
        maxvalue = f[i]
print(maxvalue)

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

num = list(map(int,input().split()))
A = num[0]
B = num[1]

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

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

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

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

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

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

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

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

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

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

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

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

print(max(l))

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

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

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

ans1 = a + b
ans2 = a - b
ans3 = a * b

print(max(ans1, ans2, ans3))

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

add = A + B
sub = A - B
times = A * B
calc_result = [add, sub, times]

print(max(calc_result))

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

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

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

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

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

ls = []
ls.append(a+b)
ls.append(a-b)
ls.append(a*b)
print(max(ls))

Solution (Python):
a, b = map(int, input().split())
wa = a + b
sa = a - b
seki = a * b
s = [a + b, a - b, 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())

plus = a + b
mnus = a - b
kakeru = a * b

ans = max(plus, mnus, kakeru)
print(ans)

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

Solution (Python):
list = input().split()
a = int(list[0])
b = int(list[1])
ans = a+b
ans_2 = a-b
ans_3 = a*b
if ans_2>ans:
    ans = ans_2
if ans_3>ans:
    ans = ans_3
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())

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

print(max(L))

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

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

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

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

Solution (Python):
x=input()
x =x.split(" ")
c = [int(str) for str in x]
a=c[0]
b=c[1]
if a+b>=a-b and a+b>=a*b:
  print(a+b)
elif a-b>=a+b and a-b>=a*b:
  print(a-b)
elif a*b>=a+b and a*b>=a-b:
  print(a*b)

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

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

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

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

print(max(a, s, m))

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

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

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

Solution (Python):
A,B = 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):
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):
l=list(map(int,input().split()))
 
if l[0]+l[1]>=l[0]-l[1] and l[0]+l[1]>=l[0]*l[1]:
    print(l[0]+l[1])
elif l[0]-l[1]>=l[0]+l[1] and l[0]-l[1]>=l[0]*l[1]:
    print(l[0]-l[1])
elif l[0]*l[1]>=l[0]-l[1] and l[0]*l[1]>=l[0]+l[1]:
    print(l[0]*l[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())
x=[a+b,a-b,a*b]
print(max(x))

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

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

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

print(max(hoge))

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

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

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

print(max(in_list))

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

Solution (Python):
data = list(map(int,input().split()))
add = data[0] + data[1]
sub = data[0] - data[1]
mul = data[0] * data[1]
result = [add,sub,mul]
ans = add
if sub > ans:
  ans = sub
if mul > ans:
  ans = mul
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())
t=a+b
h=a-b
k=a*b

kekka=[t,h,k]
kekka.sort()

print(kekka[-1])

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

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

Solution (Python):

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

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

print(max(plus, minus, multi))

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

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

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

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

Solution (Python):

import math
import datetime





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

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

print (list[2])

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

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

print(result)

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

Solution (Python):
a, b = map(int, input().split())
print(max(max(a+b, 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 = (int(i) for i in input().split())
x = a+b
y = a-b
z = a*b
ans = max(x,y,z)
print(ans)

Solution (Python):
A, B=map(int, input().split())
print(max(A+B,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
List = [a,b,c]
print(max(List))