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(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())
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=[A,B,C]
print(max(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())
c = a + b 
d = a - b
e = a * b
if (c >= d) and (c >= e):
    print(c)
elif (d >= c) and (d >= e):
    print(d)
else:
    print(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())
print(max(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):
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    A, B = input_nums()
    ans = max(A+B, A-B)
    ans = max(ans, A * B)
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  a, b = map(int, readline().split())
  print(max(a+b, a-b, a*b))
  
  
if __name__ == '__main__':
  main()

Solution (Python):
p,q = input().split()
(a,b) = (int(p), int(q))
a_list = [a+b, a-b,a*b]
print(max(a_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=[]
c=a+b
d=a-b
e=a*b
p=[a+b,a-b,a*b]
print(max(p))

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

Solution (Python):
import sys

a, b = map(int, sys.stdin.readline().split())

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

if __name__ ==  '__main__':
    main()

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

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

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

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

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

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

Solution (Python):

GBN_DEBUG = False
def dprn(s, i):
    if GBN_DEBUG: print(", " + s + " = " + str(i), end = "")
def dprns(s):
    if GBN_DEBUG: print(", " + s, end = "")
def dprni(i):
    if GBN_DEBUG: print(i, end=" ")
def endl(): 
    if GBN_DEBUG: print('')
def puts(s): print(s)






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





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

ans = max(s, d)
ans = max(ans, p)

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

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

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

Solution (Python):
def main():
    a, b = map(int, input().split())
    ans = a+b

    if ans < a-b:
        ans = a-b
    if ans < a*b:
        ans = a*b
    print(ans)

main()

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

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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

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

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

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

if x >= y and x >= z:
	answer = x

elif y >= x and y >=z:
	answer = y

elif z >= x and z >= y:
	answer = z
    
print(answer)

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

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

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

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

max_n = -10000000000

if a+b > max_n:
    max_n = a +b

if a - b > max_n:
    max_n = a - b

if a*b > max_n:
    max_n = a*b

print(max_n)

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

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

print(max(tasu,hiku,kake))

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

print(max(i,k,j))

Solution (Python):


A, B = map(int, input().split())
num_list = []

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

ans_max = max(num_list)
print(ans_max)

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

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

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

Solution (Python):


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

S = 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, a-b, a*b]))

Solution (Python):
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)

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

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

Solution (Python):












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

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

ans = max(ans1,ans2,ans3)

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

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

ans = max(add,sub,mul)
print(ans)

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 >= c and d >= e:
    print(d)
else:
    print(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())

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

print(max(results))

Solution (Python):

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

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

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

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

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

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

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

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

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

Solution (Python):

"""
A - +-x
https://atcoder.jp/contests/abc137/tasks/abc137_a

"""
import sys


def solve(A, B):
    return max(A + B, A - B, A * B)


def main(args):
    A, B = map(int, input().split())
    ans = solve(A, B)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[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(a+b,a-b,a*b))

Solution (Python):
l=input().split()
a=int(l[0])
b=int(l[1])

sum=a+b
sub=a-b
multi=a*b
if ((sum>=sub)and(sum>=multi)):
    print(sum)
elif((sub>sum)and(sub>multi)):
    print(sub)
else:
    print(multi)

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

Solution (Python):
A,B = map(int,input().split())
X = A + B
Y = A - B
Z = A * B
if X >= Y and X >= Z:
     print(X)
elif Y >= Z and Y >= X:
     print(Y)
elif Z >= X and Z >= Y:
     print(Z)

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

Solution (Python):
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *

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

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 solve():
    N, M = map(int, input().split())
    return max(N+M, N-M, N*M)

print(solve())

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

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

tmp = max(plus,minus)
result = max(div,tmp)

print(result)

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

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

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

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

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

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

Solution (Python):
A, B = map(int, input().split())
print(max(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
multi = A * B
ans = plus if plus > minus else minus
ans = multi if multi > ans else ans
print(ans)

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

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

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

l = []

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

print(max(l))

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

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

Solution (Python):


A, B = map(int, input().split())
num_list = []

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

ans_max = max(num_list)
print(ans_max)

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

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

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

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

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

print(ans)

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

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


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

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

    ans = a + b

    if ans < a - b:
        ans = a - b

    if ans < a * b:
        ans = 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())
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):
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):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

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

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

Solution (Python):
def main():
    N, M = (int(i) for i in input().split())
    print(max(N+M, N-M, N*M))


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

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 = list(map(int,input().split()))
b=a[0]
c=a[1]
d=[0,0,0]
d[0]=b+c
d[1]=b-c
d[2]=b*c
print(max(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())
s = a+b
m = a-b
n = a *b

print(max(s,m,n))

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

Solution (Python):

import sys


def solve(A: int, B: int):
    return max(A+B, A-B, A*B)


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))  
    print(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())
ans1 = a+b if a+b>=a-b else a-b
ans2 = ans1 if ans1>=a*b else a*b
print(ans2)

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

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

Solution (Python):
from sys import stdin

a, b = (int(x) for x in stdin.readline().rstrip().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(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):
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B = list(map(int, sys.stdin.readline().split()))

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
a, b = 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())
add=A+B
sub=A-B
mul=A*B
print(max(max(add,sub),mul))

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

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

Solution (Python):





import sys

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    a, b = list(map(int,ipti().split()))
    ans = a + b
    ans = max(ans,a-b)
    ans = max(ans,a*b)

    print(ans)

if __name__ == '__main__':
    main()

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

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

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

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

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

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

print(max(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):


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

Solution (Python):
a, b = map(int,input().split())
 
x = a + b
y = a - b
z = a*b
 
if x != y and y != z and x != z:
    if x > y and x > z:
        print(x)
    else:
        if y > z:
            print(y)
        else:
            print(z)
else:
    pass
if x == y and y ==  z and x == z:
    print(x)
else:
    pass
if x == y and x != z:
    if x > z:
        print(x)
    else:
        print(z)
else:
    pass
if y == z and y != x:
    if y > x:
        print(y)
    else:
        print(x)
else:
    pass
if x == z and x != y:
    if x > y:
        print(x)
    else:
        print(y)
else:
    pass

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

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

print(max(x, y, z))

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

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

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

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

print(ans)

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

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

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

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

Solution (Python):


number = input().split(" ")
A = int(number[0])
B = int(number[1])
ans = []
ans.append(int(A + B))
ans.append(int(A - B))
ans.append(int(A * B))
ans.sort()
print(ans[-1])

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 >= p and m >= t:
    print(m)
elif t >= p and t >= m:
    print(t)

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

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

Solution (Python):
a, b = 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
ans = max(p,m,b)
if ans == p:
  print(p)
elif ans == m:
  print(m)
else:
  print(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())
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())

SUM = A + B
MINUS = A - B
kakeru = A * B

temp1 = max(SUM, MINUS)
temp2 = max(temp1, kakeru)

print(temp2)

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

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

print(max(p,q,r))

Solution (Python):
import sys

a, b = map(int, sys.stdin.readline().split())

def main():
    return max(a+b, a-b, a*b)

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

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

Solution (Python):
A,B = map(int, input().split())
X,Y,Z = 0,0,0

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

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

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

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

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

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

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

if a + b >= a - b and a + b >= a * b:
    print(a+b)
elif a-b >= a+b and a-b >= a*b:
    print(a-b)
else:
    print(a*b)

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

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

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

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

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

print(max(x, y, z))

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

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

Solution (Python):
import math

class Input():
	def readInt(self):
		return int(input())

	def readIntArray(self):
		return [int(x) for x in input().split(" ")]

	def readString(self):
		return input()

	def readStringArray(self):
		return input().split(" ")

	def readFloat(self):
		return float(input())

	def readFloatArray(self):
		return [float(x) for x in input().split(" ")]

def main():
	inp = Input()
	a, b = inp.readIntArray()
	ans = max([a+b, a-b, a*b])
	print(ans)
	

if __name__ == "__main__":
   main()

Solution (Python):
In = input().split()
n1 = int(In[0])
n2 = int(In[1])
sum = n1 + n2; minus = n1 -n2; mult = n1*n2
if sum >= minus and sum >= mult:
    print(sum)
if minus > sum and minus > mult:
    print(minus)
if mult > sum and mult > minus:
    print(mult)

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

tmp = A + B
ans = tmp
tmp = A - B
if tmp > ans: ans = tmp
tmp = A * B
if tmp > ans: ans = tmp

print(ans)

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B = MAP()

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

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

list = [A+B,A-B,A*B]
list.sort(reverse=True)

print(list[0])

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

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

if A == 1 and B == 1:
    print(2)
elif A > 1 and B == 1:
    print(A+B)
elif A == 1 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):
import sys

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

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

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

print(max(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())
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(ab) for ab in input().split())
print(max([A+B, A-B, A*B]))

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

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

print(max(x,y,z))

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

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