Problem:


Score : 100 points

Problem Statement

You are given two integers A and B.
Find the largest value among A+B, A-B and A \times B.

Constraints

-1000 \leq A,B \leq 1000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the largest value among A+B, A-B and A \times B.

Sample Input 1

3 1

Sample Output 1

4

3+1=4, 3-1=2 and 3 \times 1=3. The largest among them is 4.

Sample Input 2

4 -2

Sample Output 2

6

The largest is 4 - (-2) = 6.

Sample Input 3

0 0

Sample Output 3

0



Sample input:
3 1


Sample output:
4

Submission status: Accepted

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

Submission status: Accepted

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

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

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())
C = A + B
D = A - B
E = A * B
ans = max(C,D,E)
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, B = map(int, input().split())  
ans = max(A+B, A-B, A*B)
print(ans)

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper

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

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:
# ABC098A - Add Sub Mul
a, b = list(map(int, input().rstrip().split()))
print(max(a + b, a - b,  a * b))

Submission status: Accepted

Solution code:
A, B = (int(i) for i 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:
a, b = map(int, input().split())
ab1 = a+b
ab2 = a*b
ab3 = a-b
print(max([ab1, ab2, ab3]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)


if __name__ == '__main__':
    main()

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())
P=A+B
M=A-B
MUL=A*B

print(max(P,M,MUL))

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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]
c.sort()
print(c[2])

Submission status: Accepted

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

add = A + B
sub = A - B
mul = A * B

if add > sub and add > mul:
    print(add)
elif sub > add and sub > mul:
    print(sub)
elif mul > add and mul > sub:
    print(mul)
else:
    print(add)

Submission status: Accepted

Solution code:
#!/usr/bin/python

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 = map(int, input().split())

max = -1000
if A + B > max:
    max = A + B
if A - B > max:
    max = A - B
if A * B > max:
    max = A * B
print(max)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#098
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]

a = 0
s = 0
m = 0

def add(a, b):
  return a + b

def sub(a, b):
  return a - b

def mul(a, b):
  return a * b

a = add(A, B)
s = sub(A, B)
m = mul(A, B)

print(max(a, s, m))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
x=a+b
y=a-b
z=a*b
if y<=x and z<=x:
    print(x)
elif x<=y and z<=y:
    print(y)
else:
    print(z)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = [int(i) for i in input().split()]
l = [s[0] + s[1], s[0] - s[1], s[0] * s[1]]
print(max(l))

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

Submission status: Accepted

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

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(sorted(a)[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
old = [int(i) for i in input().split()]
print(max([sum(old),old[0]-old[1],old[0]*old[1]]))

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

Submission status: Accepted

Solution code:
a, b = map(int, raw_input().split())
c = a + b
if a - b > c:
    c = a - b
if a * b > c:
    c = a * b
print c

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max(add, sub, multi))

Submission status: Accepted

Solution code:
## [標準入力を受け取る] ##
line = input()  # 標準入力を文字列として受け取ります
# print(line)  # for debugging
arrayed_line = line.split(" ")  # スペース区切りで与えられたものをスペースで分割して配列に格納します
# print(arrayed_line)  # for debugging
a = int(arrayed_line[0])  # 文字列を数字に変換します
b = int(arrayed_line[1])  # 文字列を数字に変換します

## [計算する] ##
ans = 0  # 答えは恐らく数字なので、まず0とします

plus = a+b  # 足し算
minus = a-b # 引き算
multiply = a*b # 掛け算

ans = plus  # 答えをとりあえず足し算の結果とする

if minus > ans:  # 引き算のほうが答え(予定)より大きければ
    ans = minus  # 答えを引き算にする

if multiply > ans:  # 掛け算のほうが答え(予定)より大きければ
    ans = multiply  # 答えを掛け算にする

## [答えを出力する] ##
print(ans)  # 答え(ans)を出力します

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

apb = a + b
asb = a - b
ab = a * b

print(max(apb, asb, 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 = [int(item) for item 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()]
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())

max = a + b
if max < a - b:
    max = a - b
if max < a * b:
    max = a * b

print(max)

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

Submission status: Accepted

Solution code:
list1 = [int(a) for a in input().split()]
list1_0 = list1[0] #A
list1_1 = list1[1] #B

plus = list1_0 + list1_1
minus = list1_0 - list1_1
mul = list1_0 * list1_1

max_ans = max(plus, minus, mul)

print(max_ans)

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

Submission status: Accepted

Solution code:
def solve(string):
    a, b = map(int, string.split())
    return str(max(a + b, a - b, a * b))


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
wa = A+B
sa = A-B
seki = A*B
if(wa > sa and wa > seki):
    print(wa)
elif(sa > seki):
    print(sa)
else:
    print(seki)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# /user/bin/python
# -*- coding: utf-8 -*-


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:
# -*- coding: utf-8 -*-
import sys

def main():
	A, B = map(int, input().split(" "))
	
	a = A + B
	b = A - B
	c = A * B
	
	print(max(a, b, c))
		
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
def add_sub_mul(A: int, B: int) -> int:
    return max(A+B, A-B, A*B)


if __name__ == "__main__":
    A, B = map(int, input().split())
    ans = add_sub_mul(A, B)
    print(ans)

Submission status: Accepted

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

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:
# coding: utf-8
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 = max([A + B, A - B, A * B])
print(ans)

Submission status: Accepted

Solution code:
#S=input()
#N=int(input())
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())
li = [A+B, A-B, A*B]
print(max(li))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc098/tasks/abc098_a
a, b = [int(x) for x in input().split()]
print(sorted([a + b, a - b, a * b])[-1])

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(ans)
print()

Submission status: Accepted

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

Submission status: Accepted

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

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

List=[p,m,k]
print(max(List))

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

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(lambda x: int(x), input().split())

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

Submission status: Accepted

Solution code:
from sys import stdin
a,b=[int(x) for x in stdin.readline().rstrip().split()]
print(max([a+b, a-b, a*b]))

Submission status: Accepted

Solution code:
import sys

def main():
  input = sys.stdin.readline
  A, B = map(int, input().split())
  print(max(A+B, A-B, A*B))


if __name__ == '__main__':
  main()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main() -> None:
    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())
li = [a+b, a-b, a*b]

print(max(li))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a < 0 and b < 0:
    print(a*b)
elif b < 0:
    print(a-b)
else:
    if a*b <= a+b:
        print(a+b)
    else:
        print(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())
S=A+B
T=A-B
U=A*B
if (S>=T) & (S>=U):
    print(S)
elif (T>=S) & (T>=U):
    print(T)
else:
    print(U)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
int_a, int_b = map(int, input().split())

ar = []

ar.append(int_a + int_b)
ar.append(int_a - int_b)
ar.append(int_a * int_b)

print(max(ar))

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 = A + B
Sub = A - B
Mul = A * B
Max = max(Sum,Sub,Mul)

print(Max)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(max(sum))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
# ----------------------------------------------------------------
# Use Solve Function

def solve(lines):
    A,B = map(int, lines.pop(0).split(' '))
    print(max( A+B, A-B, A*B ))

#
# main
#

# 1. use list instead of stdin

#contents = '''\
#3 -4\
#'''
#lines = contents.split('\n')

# 2. use stdin

lines = [x.strip() for x in sys.stdin.readlines()]

#
# solve !!
#
solve(lines)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
c = []
c.append(a+b)
c.append(a-b)
c.append(a*b)
c = sorted(c,reverse=True)
print(c[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 = [int(n) for n in input().split()]

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

print(max(a, max(s, m)))

Submission status: Accepted

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


main()

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())
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:
""" AtCoder """

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def main():
    na = list(map(int, input().split()))
    A, B = na[0], na[1]

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
def main(a,b):
    return max([a*b,a+b,a-b])
print(main(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 = a+b
d = a-b 
f = a*b
if s>=d>=f or s>=f>=d:
    print(s)
elif d>=f>=s or d>=s>=f:
    print(d)
else:
    print(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:
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:
a,b=map(int,input().strip().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=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)

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

Submission status: Accepted

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

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

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

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

print(max(p, m, t))

Submission status: Accepted

Solution code:
A,B = map(int,input().split())
list = [A+B,A-B,A*B]
list.sort(reverse=True)
print(list[0])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    """Function."""
    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(" "))
print(max(a+b,a-b,a*b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

n = A + B
if (max < n) :
    max = n

n = A * B
if (max < n) :
    max = n

n = A - B
if (max < n) :
    max = n

print(max)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solution(x, y):
    return max(x + y, max(x - y, x * y))

def main():
    x, y = [int(i) for i in raw_input().strip().split()]
    print solution(x, y)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(max(C))

Submission status: Accepted

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

C1 = A + B

C2 = A - B

C3 = A * B

C = [ C1, C2, C3]

print(max(C))

Submission status: Accepted

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

C1 = A + B

C2 = A - B

C3 = A * B

C = [ C1, C2, C3]

C = sorted(C)

print(C[2])

Submission status: Accepted

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

C1 = A + B
C.append(C1)

C2 = A - B
C.append(C2)

C3 = A * B
C.append(C3)

C = sorted(C)

print(C[2])

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

c=[]

c.append(b[0]+b[1])
c.append(b[0]-b[1])
c.append(b[0]*b[1])

c.sort()

print(c[2])

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

Submission status: Accepted

Solution code:
import sys
a, b = list(map(int, sys.stdin.readline().strip().split(' ')))
sys.stdout.write(str(max(a+b, a-b, a*b)) + '\n')

Submission status: Accepted

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

case1 = a+b
case2 = a-b
case3 = a*b


result = max(case1,case2,case3)

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

Submission status: Accepted

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

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

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())
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 = map(int, input().split())

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

print(max(plus,minus,multiple))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

num = raw_input().strip().split()
add = 0
minus = 0
mul = 1
cnt = 1

for n in num:
    add += int(n)
    mul *= int(n)
    if cnt == 1:
        minus = int(n)
        cnt = 0
    else:
        minus -= int(n)

print(str(max(add, 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())
max_=a+b
if a-b>max_:
  max_=a-b
if a*b>max_:
  max_=a*b
print(max_)

Submission status: Accepted

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

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 run(a, b):
    return max([a+b, a-b, a*b])


def main():
    a, b = map(int, input().split())
    print(run(a, b))


if __name__ == '__main__':
    main()

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

if  (type(a)==int) and( type(b)==int) and (-1000 <= a and 1000>=a ) and (-1000 <= b and 1000>=b ):
    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:
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
D = A - B
E = A * B
L = [C, D, E]
L.sort()

print(L[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
a,b  = map(int, input().split())

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

Submission status: Accepted

Solution code:
#coding: utf-8
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 = list(map(int, input().split()))
print(max(a+b, a-b, a*b))