Problem:
 Score : 100 points    Problem Statement We have two integers: A and B .  Print the largest number among A + B , A - B , and A \times B .      Constraints  All values in input are integers.  -100 \leq A,\ B \leq 100         Input Input is given from Standard Input in the following format:  A  B       Output Print the largest number among A + B , A - B , and A \times B .        Sample Input 1 -13 3      Sample Output 1 -10  The largest number among A + B = -10 , A - B = -16 , and A \times B = -39 is -10 .       Sample Input 2 1 -33      Sample Output 2 34  The largest number among A + B = -32 , A - B = 34 , and A \times B = -33 is 34 .       Sample Input 3 13 3      Sample Output 3 39  The largest number among A + B = 16 , A - B = 10 , and A \times B = 39 is 39 .

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

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

Solution (Python):
S=input()
print(max([eval(S.replace(' ',i)) for i in '+-*']))

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

p = A+B
m = A-B
M = A*B

L = []

L.append(p)
L.append(m)
L.append(M)

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

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

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

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

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

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

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

    
if '__main__' == __name__:
    resolve()

Solution (Python):


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

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

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

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

print(max(list_ab))

Solution (Python):
a,b = map(int,input().split())
plus = a + b
minus = a - b
times = a * b
maxi = plus
if maxi <= minus:
  maxi = minus
if maxi <= times:
  maxi = times
  
print(maxi)

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

answer = [X,Y,Z]
print(max(answer))

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

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

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

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

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

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

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

Solution (Python):
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

A, B = rl()

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

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

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

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

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

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

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

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

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

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

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

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

print(max(plus, minus, by))

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

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

Solution (Python):


import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

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

if __name__ == "__main__":
    main()

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

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

num = [a, b, c]

max_num = max(num)


print(max_num)

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

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

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


if __name__ == "__main__":
    solve()

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

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

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

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

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

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

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

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

temp = plus
if plus < minus:
    temp = minus
if temp < by:
    temp = by
print(temp)

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

out1 = A+B
out2 = A-B
out3 = A*B

print(max(out1, out2, out3))

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

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

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

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

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

apb = a + b
amb = a - b
amlb = a * b

l = sorted([apb, amb, amlb], reverse=True)

print(l[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())

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

print(max(cal))

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

if __name__ == '__main__':
    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):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a, b = LI()
print(max(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=input().split()
a = eval(A+"+"+B)
b = eval(A+"-"+B)
c = eval(A+"*"+B)
print(max(a,b,c))

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

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

Solution (Python):
import sys









input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 1000000007

def solve():
    a,b = getList()
    print(max([a+b, a - b, a * b]))
    return
def main():
    n = getN()
    for _ in range(n):
        solve()
if __name__ == "__main__":
    
    solve()

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

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

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

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

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

a,b = iim()
l = [a-b,a+b,a*b]
l.sort()
print(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())
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())

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    A, B = map(int, readline().split())

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

    return


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())
C = A + B
D = A - B
E = A * B
lists = [C, D, E]
lists.sort()
print(lists[-1])

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

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

Solution (Python):
a, b = map(int, input().split())
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):
a, b = map(int, input().split())
c = a + b
d = a - b
e = a * b
lists = [c, d, e]
lists.sort()
print(lists[-1])

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

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

max_n = max(p, m)
max_n = max(max_n, k)

print(max_n)

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

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())
    l = []
    l.append(a + b)
    l.append(a - b)
    l.append(a * b)
    l.sort()
    print(l[2])

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

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

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

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

answers.sort(reverse=True)
print(answers[0])

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

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

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

Solution (Python):
a1=input()
res=[i for i in a1.split()]
A,B=[float(res[i]) for i in (0,1)]
a,b=A.is_integer(),B.is_integer()
if a and b == True and -100<=(A and B)<=100:
    A,B=int(A),int(B)
    x=A+B
    y=A-B
    z=A*B
    print(max(x,y,z))

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

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

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

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

print(max(x))

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

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

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

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

n = a + b
m = a - b
l = a * b

list = []
list.append(n)
list.append(m)
list.append(l)

print(max(list))

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

if __name__ == '__main__':
    solve()

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

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

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

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

print(max(LAB))

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

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

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())
print(max(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(a) for a in 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]
ans = max(l)
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())
M = max(A + B, A - B, A * B)
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())
num_list = [A + B,A - B,A * B]
print(max(num_list))

Solution (Python):
a, b = map(int, input().split())
p = a + b
h = a - b
k = a * b
if p >= h and p >= k:
    print(p)
elif h > p and h > k:
    print(h)
else:
    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())
print(max(a+b,a-b,a*b))

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

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

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    solve()

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

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

print(max(cal))

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


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

Solution (Python):
A,B = map(int,input().split())
G = A + B
i = A * B
t = A - B
Y = max(G,i,t)
print(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())
lst = [A+B, A-B, A*B]
print(max(lst))

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

Solution (Python):
def inp():return map(int,input().split())
a,b=inp()
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):
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(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):
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):
import sys


def input():
    return sys.stdin.readline().strip()

def main():
    a, b = map(int, input().split())
    sum = a + b
    d = a - b
    times = a * b
    if sum >= d:
        ans = sum
    else:
        ans = d
    if ans < times:
        print(times)
        return
    print(ans)
        
    
main()

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

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

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[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):
n,s= map(int,input().split())
print(max(n+s,n-s,n*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())
result=[a+b,a*b,a-b]
result.sort()
print(result[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):
import sys
sys.setrecursionlimit(10**6)



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

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

Solution (Python):
def main():
  num = list(map(int,input().split()))
  if num[0]+num[1]>num[0]-num[1]:
    if num[0]+num[1]>num[0]*num[1]:
      print(num[0]+num[1])
    else:
      print(num[0]*num[1])
  else:
    if num[0]-num[1]>num[0]*num[1]:
      print(num[0]-num[1])
    else:
      print(num[0]*num[1])
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())
c = a+b
d = a-b
e = a*b
print(max(c,d,e))

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

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

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

Solution (Python):
a, b = map(int, input().split())
x = a+b
y = a-b
z = a*b
lst = [x, y, z]
s_lst = sorted(lst)
print(s_lst[2])

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

Solution (Python):
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


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

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

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

Solution (Python):

import sys
input = sys.stdin.readline









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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
a,b=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 B>=0:
  if x - z >= 0:
    print(x)
  else:
    print(z)
else:
  if y - z >= 0:
    print(y)
  else:
    print(z)

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

Solution (Python):
def solve():
  a, b = map(int, input().split())
  print(max(a+b, a-b, a*b))
  return 0
 
if __name__ == "__main__":
  solve()

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

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

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

Solution (Python):

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    A, B = map(int, readline().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())

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

S.sort(reverse=True)

print(S[0])

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

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

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

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

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

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

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

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

list=[x,y,z]

print(max(list))

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

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

p = a + b
m = a - b
t = a * b

if p >= m and p >= t:
    print(p)
elif m >= t:
    print(m)
else:
    print(t)

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

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

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

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

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

Solution (Python):
def maxreturn(a, b):

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

if __name__ == '__main__':
    main()

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

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

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

a = x[0]
b = x[1]
r = [0]*3
r[0] = a-b
r[1] = a+b
r[2] = a*b

print(max(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());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())
a=A+B
b=A-B
c=A*B
if a < b:
    a = b
if a < c:
    a = c
print(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())
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):
a,b=map(int,input().split())
max_ab = -100
max_ab = max(a+b,max_ab)
max_ab = max(a-b,max_ab)
max_ab = max(a*b,max_ab)
print(max_ab)

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

Solution (Python):
a,b = map(str,input().split())
ans = [eval(a+'+'+b),eval(a+'-'+b),eval(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())
print(max(a+b,a-b,a*b))

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):
def main():
    A,B = [int(i) for i in input().split()]
    list=[]
    sum=A+B
    sub=A-B
    multi=A*B
    list.append(sum)
    list.append(sub)
    list.append(multi)
    print(max(list))

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