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.



Sample input:
-13 3


Sample output:
-10

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max(rist))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

max_list = []
max_list.append(ab[0] + ab[1])
max_list.append(ab[0] - ab[1])
max_list.append(ab[0] * ab[1])
max_list.sort()
print(max_list[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
add = a + b
sub = a - b
mul = a * b
callist = [add, sub, mul]
print(max(callist))

Submission status: Accepted

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

Submission status: Accepted

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

c = []

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

print(max(c))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max_num)

Submission status: Accepted

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

Submission status: Accepted

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AB=input().split()
A,B=int(AB[0]),int(AB[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max(list))

Submission status: Accepted

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

Submission status: Accepted

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


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

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


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


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

Submission status: Accepted

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

Submission status: Accepted

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

-100<=A
B<=100

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = list(map(int, input().split()))
a = tmp[0]
b = tmp[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
def fn(a,b):
    x = a + b
    y = a - b
    z = a * b
    l = [x,y,z]
    return l
print(max(fn(a,b)))

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 19,Oct,2019
"""

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, exit

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
numbers =input().rstrip().split(" ")
a =int(numbers[0])
b =int(numbers[1])
values =[0,0,0]
values[0]=a+b
values[1]=a-b
values[2]=a*b
#print(values)
ranking =sorted(values ,reverse=True)
#print(ranking)
print(ranking[0])

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
ans = A + B
if A - B > ans:
  ans = A - B
if A * B > ans:
  ans = A * B
print(ans)

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
#map(int,input().split())これはカンニングしました。なにこれ？笑
print(max(A+B,A-B,A*B))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

res = [abp, abm, abmp]

res.sort()

print(res[-1])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
args = sys.argv
if len(args) == 2:
  from IPython import embed
  em = True
else:
  em = False
input = sys.stdin.readline
A, B = map(int, input().split())
if em: sys.stdin = open('/dev/tty')
print(max(A+B, A-B, A*B))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
ans = []
ans.append(a+b)
ans.append(a-b)
ans.append(a*b)

print(max(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B = (int(x) for x in input().split() )

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#1行に数値が複数の場合
a, b = map(int, input().split())
#max(value, value, value)で最大値を出力
#a + b →a + b
#a - b →a - b
#a x b →a * b
print(max(a + b, a - b, a * b))

Submission status: Accepted

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

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

print(max(sum,min,mul))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B = list(map(int,input().split()))
p = int(A + B)
m = int(A - B)
c = int(A * B)
s = [p,m,c]
print(max(s))

Submission status: Accepted

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

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

print(F)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max(s, d, m))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

print(max(wa,sa,seki))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INPUT = list(map(int,input().split()))

A = INPUT[0]
B = INPUT[1]
print(max(A*B,A+B,A-B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
X=A+B
Y=A-B
Z=A*B
print(max(X,Y,Z))

Submission status: Accepted

Solution code:
a, b = input().split()
a = int(a)
b = int(b)
plus = a + b
minus = a - b
mul = a * b
print(max(plus, minus, mul))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print (max(a+b, a-b, a*b))
#こぴぺ

Submission status: Accepted

Solution code:
i=list(map(int,input().split()))
a=i[0]
b=i[1]
def max(x,y,z):
  if x>y:
    m=x
  else:
    m=y
  if z>m:
    m=z
  return m
ans=max(a+b,a-b,a*b)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input().split(" ")
A,B=int(a[0]),int(a[1])
print(max([A+B,A-B,A*B]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=input().split()
a=int(A)
b=int(B)
s=a+b
t=a-b
u=a*b
x=max(s,t,u)
print(x)

Submission status: Accepted

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

s = A+B
p=A-B
q =A*B

print(max(s,p,q))

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit
setrecursionlimit(10000000)

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,queue,copy
sys.setrecursionlimit(10**8)
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))

Submission status: Accepted

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

Ab = A+B
aB = A-B
AB = A*B

print(max(Ab, aB, AB))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
times = a*b
add= a+b
minus=a-b

if times > minus:
	if times > add:
  		print(times)
	else:
  		print(add)
else:
  if add>minus:
    print(add)
  else:
    print(minus)

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys,collections,itertools,re,math,fractions,decimal,random,array,bisect,heapq

# decimal.getcontext().prec = 50
# sys.setrecursionlimit(10000)
# MOD = 10**9 + 7

def solve(f):
    a, b = f.read_int_list()
    return max([a+b, a-b, a*b])


class Reader(object):
    def __init__(self, filename=None):
        self.file = open(filename) if filename is not None else None
        self.case = 1

    def __readline(self):
        return self.file.next().strip() if self.file else raw_input()

    def next_case(self):
        self.file.next()
        self.case += 1

    def read_int(self): return int(self.__readline())
    def read_float(self): return float(self.__readline())
    def read_long(self): return long(self.__readline())
    def read_decimal(self): return decimal.Decimal(self.__readline())
    def read_str(self): return self.__readline()

    def read_int_list(self): return map(int, self.__readline().split())
    def read_float_list(self): return map(float, self.__readline().split())
    def read_long_list(self): return map(long, self.__readline().split())
    def read_decimal_list(self): return map(decimal.Decimal, self.__readline().split())
    def read_str_list(self): return self.__readline().split()

if __name__ == '__main__':
    filename = sys.argv[1] if len(sys.argv) > 1 else None
    f = Reader(filename)
    if f.file:
        while True:
            print "Case #%d\n"%f.case, solve(f)
            try:
                f.next_case()
            except StopIteration:
                break
    else:
        print solve(f)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import *
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b = LI()
    print(max(a + b, a - b, a * b))
    return

#B
def B():
    k, x = LI()
    ans = []
    for i in range(x - k + 1, x + k):
        ans.append(i)
    print(*ans)
    return

#C
def C():
    n = II()
    d = defaultdict(int)
    for _ in range(n):
        s = S()
        s.sort()
        d[tuple(s)] += 1
    ans = 0
    for i in d.values():
        ans += i * (i - 1) // 2
    print(ans)
    return

#D
def D():
    n, m = LI()
    ab = LIR(n)
    ab.sort(key=lambda x: (x[1], x[0]), reverse=True)
    ans = 0
    for i in range(n):
        if m >= ab[i][0]:
            ans += ab[i][1]
            m -= 1
    print(ans)
    return

#E
def E():
    return

#F
def F():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
num_list = [int(n) for n in input().split()]
a = num_list[0]
b = num_list[1]

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

Submission status: Accepted

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

A1 = A + B
A2 = A - B
A3 = A * B

print(max([A1,A2,A3]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().split(" ")
A = int(s[0])
B = int(s[1])

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

print(max(l))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=list(map(int,input().split()))
c=a+b
d=a-b
e=a*b
n=[c,d,e]
print(max(n))

Submission status: Accepted

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

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

Submission status: Accepted

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

ad=int(A)+int(B)
mi=int(A)-int(B)
de=int(A)*int(B)

math=[ad,mi,de]

m_max=max(math)

print(m_max)

Submission status: Accepted

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

result = [A + B, A - B, A * B]
result.sort(reverse=True)
print(result[0])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max(sum_val, sub_val, mul_val))

Submission status: Accepted

Solution code:
A_B = list(map(int, input().split()))
L = []
L.append(A_B[0] + A_B[1])
L.append(A_B[0] - A_B[1])
L.append(A_B[0] * A_B[1])
print(max(L))

Submission status: Accepted

Solution code:
p = list(map(int,input().split()))
print(max(sum(p),p[0] - p[1],p[0] * p[1]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max(c,d,e))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, open(0).read().split())

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

    ans = max(add, sub, mult)
    print(ans)
    return()

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print("{}".format(max([A + B, A - B, A * B])))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int):
    add = A + B
    sub = A - B
    mul = A * B

    result = max(max(add, sub), mul)

    print(result)
    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))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=[int(i) for i in input().split()]
ans=n[0]+n[1]
if(ans<n[0]-n[1]):ans=n[0]-n[1]
if(ans<n[0]*n[1]):ans=n[0]*n[1]
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=sys.stdin.readline
def resolve():
    a,b=map(int,input().split())
    print(max(a+b,a-b,a*b))
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = [int(x) for x in input().split()]
abp = a + b
abm = a - b
abt = a * b
if abp > abm:
  if abp > abt:
    print(abp)
  else:
    print(abt)
else:
  if abm > abt:
    print(abm)
  else:
    print(abt)

Submission status: Accepted

Solution code:
def resolve():
    import sys
    input=sys.stdin.readline
    a,b=map(int,input().split())
    print(max((a+b,a-b,a*b)))
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b = input().split()
 
a,b = int(a), int(b)
 
total = a+b
 
if a*b > total:
  total = a*b
 
if a-b > total:
  total = a-b
  
print(total)

Submission status: Accepted

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

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

total = a+b

if a*b > total:
  total = a*b

if a-b > total:
  total = a-b
  
print(total)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#AtCoder

import sys
import math
import itertools

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)


"""

"""

Submission status: Accepted

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

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

print(max(ans))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
AB=input()
AB=AB.split(" ")
A=int(AB[0])
B=int(AB[1])
print(max([A+B, A-B, A*B]))

Submission status: Accepted

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