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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


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

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




print(main())

Submission status: Accepted

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

def em_input(s):
    a, b = map(int, s.split(" "))
    return A(a, b)

print(em_input(input()))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def getinputdata():

    # 配列初期化
    array_result = []    
    data = input()
    array_result.append(data.split(" "))

    flg = True

    try:
        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = True

            else:

                flg = False
    finally:

        return array_result

arr_data = getinputdata()

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


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

Submission status: Accepted

Solution code:
a,b = map(int,input().split(' '))
m = max(a + b,a - b)
print(max(m,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:
inp=input().split();
A=int(inp[0]);
B=int(inp[1]);

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

Submission status: Accepted

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

# AtCoder Beginner Contest
# Problem A

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

def main():
	ab = input().split()
	a = int(ab[0])
	b = int(ab[1])

	MAX = max(a + b, a - b, a * b)
	print(MAX)
	
if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

x = [1, 2, 3]

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

print(max(x))

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

Submission status: Accepted

Solution code:
nums = input().split()
numA = int(nums[0])
numB = int(nums[1])

answers = [numA + numB, numA - numB, numA * numB]
print(max(answers))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
ab =input().split()
a,b = int(ab[0]),int(ab[1])
x = -1000
if a + b > x:
  x = a + b
if a - b > x:
  x = a - b
if a * b > x:
  x =a * b

print(x)

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


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

print(c)

Submission status: Accepted

Solution code:
import numpy as np

def calc(a , b):
    arr = np.array([0,0,0])
    arr[0] = a + b
    arr[1] = a - b
    arr[2] = a * b
    return np.max(arr)

l = list(map(int, input().split()))
print(calc(l[0], l[1]))

Submission status: Accepted

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

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

print(max(temp))

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

input = raw_input().split(" ")

A = int(input[0])
B = int(input[1])

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May 26 21:35:06 2018

@author: sakas
"""

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

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

ar = sorted(arr)

print(ar[2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

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

ans = add
if sub > ans:
    ans = sub
if mul > ans:
    ans = mul

print(ans)

Submission status: Accepted

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

# スペース区切りの整数の入力
a = list(map(int, input().split()))
b = []

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

print (max(b))

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

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

sumab = a+b
subab = a-b
timesab = a*b
inl = [sumab,subab,timesab]

print(max(inl))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input().split(" ")
a = int(data[0])
b = int(data[1])
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())

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

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,input().split())
x = a+b
y = a-b
z = a*b
if(x>y):
    if(x>z):
        print(x)
    else:
        print(z)
else:
    if(y>z):
        print(y)
    else:
        print(z)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
a, b = map(int, raw_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:
a = list(map(int,input().split()))
wk = 0
if a[0] + a[1] > a[0] - a[1]:
    wk = a[0] + a[1]
    if wk > a[0] * a[1]:
        print(wk)
    else:
        print(a[0] * a[1])
else:
    wk = a[0] - a[1]
    if wk > a[0] * a[1]:
        print(wk)
    else:
        print(a[0] * 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:
AB=input()
AB=AB.rstrip().split(" ")
A=int(AB[0])
B=int(AB[1])

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

Submission status: Accepted

Solution code:

#
a = input().split()

wa = int(a[0])+int(a[1])
minus = int(a[0])-int(a[1])
seki = int(a[0])*int(a[1])

if wa == minus and wa > seki and minus > seki:
    print(str(wa))
elif wa > minus and wa > seki:
    print(str(wa))
elif minus > wa and minus > seki:
    print(str(minus))
else:
    print(str(seki))

Submission status: Accepted

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

inp = input().split(" ")
inp_n = [int(i) for i in inp]

print(main(inp_n[0], inp_n[1]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    A, B = map(int, input().split())
    answer = max(A + B, A - B, A * B)
    print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
a, b = map(int, input().split())
ar = np.array([a+b, a-b, a*b])

print(np.max(ar))

Submission status: Accepted

Solution code:
a, b = [int(x) for x in raw_input().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:

input_lines = input().split()
N = int(input_lines[0])
M = int(input_lines[1])
print(max([N+M,N-M,N*M]))

Submission status: Accepted

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

Submission status: Accepted

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

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
max = 0
if(add>sub):
    max = add
    if(add < mul):
        max = mul
else:
    max = sub
    if(sub < mul):
        max = mul

print(max)

Submission status: Accepted

Solution code:
line = input()
line = line.split()

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

Submission status: Accepted

Solution code:
A,B=[int(i) for i in 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)
else:
    print(Z)

Submission status: Accepted

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

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

print(max(lis))

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:
  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:
tmp = input()
tmp = tmp.split()
A = int(tmp[0])
B = int(tmp[1])

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

Submission status: Accepted

Solution code:
l = input().split()

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

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

re_l = [x, y, z]

print(max(re_l))

Submission status: Accepted

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

a = int(A)
b = int(B)

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

print(ans)

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,raw_input().split())
m = a+b
if m < a-b: m = a-b
if m < a*b: m = a*b
print m

Submission status: Accepted

Solution code:
# coding: utf-8

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

c0 = a+b
c1 = a-b
c2 = a*b


if c0 >= c1:
	maxx = c0
else: maxx = c1
if c2 >= maxx:
	maxx = c2
print maxx

Submission status: Accepted

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

print(m())

Submission status: Accepted

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

Submission status: Accepted

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

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

print(max(tasu,hiku,kakeru))

Submission status: Accepted

Solution code:
# ABC098_A
numA, numB = map(int, input().split())

add = numA+numB
sub = numA-numB
mul = numA*numB

list = [add, sub, mul]

print(max(list))

Submission status: Accepted

Solution code:
a, b = (int(i) for i in 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(a+b, a-b, a*b))

Submission status: Accepted

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

Submission status: Accepted

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

l = [add,sum,mul]
ans=sorted(l)
print(ans[2])

Submission status: Accepted

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

array = [A + B, A - B, A * B]
max = array[0]
if max < array[1]:
    max = array[1]
if max < array[2]:
    max = array[2]

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

max = float("-inf")

if add > max:
    max = add
if sub > max:
    max = sub
if mul > max:
    max = mul

print(int(max))

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

Submission status: Accepted

Solution code:
# coding: utf-8
a, b = map(int, input().split())
max = -99999999999999
X = [a+b,a-b,a*b]
for i in range(len(X)):
    if X[i] > max:
        max = X[i]

print(max)

Submission status: Accepted

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

Submission status: Accepted

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

wa = A + B
sa = A - B
seki = A * B

print(max(wa, sa, seki))

Submission status: Accepted

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

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

list = [c, d, e]
print(max(list))

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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 = list(map(int, input().split()))

num = a + b
if num < a - b:
  num = a - b
  
if num < a * b:
  num = a * b
  
print(num)

Submission status: Accepted

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

mx = a + b

if a * b > mx:
    mx = a * b
if a - b > mx:
    mx = a - b

print(mx)

Submission status: Accepted

Solution code:
from sys import stdin

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

nums = []

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

print(max(nums))

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())
#rに+,-,*を代入
r = [0,0,0]
r[0] = A + B
r[1] = A - B
r[2] = A * B

#rをソートして最大の要素(r_0)を返す
r.sort()
print(r[2])

Submission status: Accepted

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


add = n[0] + n[1]
sub = n[0] - n[1]
mul = n[0] * n[1]

ans = max(add, sub, mul)
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 = [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())

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

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

ans=[]

ans.append(X)
ans.append(Y)
ans.append(Z)


print(max(ans))

Submission status: Accepted

Solution code:
AB = list(int(i) for i in input().split())

list = []

list.append(AB[0]+AB[1])
list.append(AB[0]-AB[1])
list.append(AB[0]*AB[1])

print(max(list))

Submission status: Accepted

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

# スペース区切りの整数の入力
a, b = map(int, input().split())

# 出力
print("{}".format(max([a+b, a-b, a*b])))

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]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
ans1=a+b
ans2=a-b
ans3=a*b

print(max(ans1,ans2,ans3))

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:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

a1 = a + b
a2 = a - b
a3 = a * b

print(max(a1, max(a2, a3)))

Submission status: Accepted

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

# スペース区切りの整数の入力
a, b = map(int, input().split())

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

print(max(pl, mi, mu))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 
import math
import sys
import itertools
import numpy as np


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

c = a + b
d = a - b
e = a * b
answer = c
if c < d:
    answer = d
if answer < e:
    answer = e

print(answer)

Submission status: Accepted

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

s = A+B
d = A-B
p = A*B
print(max([s, d, p]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().split(" ")
A = int(a[0])
B = int(a[1])
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(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())
t = a+b
h = a-b
k = a*b

if t>=h and t>=k:
    ans = t
elif h>=t and h >=k:
    ans = h
elif k>=t and k>=h:
    ans = k
print(ans)

Submission status: Accepted

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

import os
import sys

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	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())
temp = max(a+b,a-b)
print(max(temp,a*b))

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:
import math
import numpy as np


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

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

big = max(lst)

print(big)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May 26 21:00:01 2018

@author: maezawa
"""

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
from sys import stdin


def main():
    A, B = [int(x) for x in stdin.readline().rstrip().split()]
    print(max([A + B, A - B, A * B]))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(c[-1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

AplusB = A + B
AsubB = A - B
AmulB = A * B

print(max(AplusB, AsubB, AmulB))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

    print(c)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

A = inp[0]
B = inp[1]

wa = A + B
sa = A - B
seki = A * B

ans = max([wa, sa, seki])
    
print(ans)

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,raw_input().split())

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

Submission status: Accepted

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

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

print(R)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(max(pre))

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

mul = A*B 
pull = A-B
plus = A+B

a = [mul, pull, plus]

print(max(a))

Submission status: Accepted

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

Submission status: Accepted

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

list = []

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

print(max(list))

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

Submission status: Accepted

Solution code:
# 整数の入力
A, B = list(map(int, input().split(" ")))

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

Submission status: Accepted

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

Submission status: Accepted

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

c = [0,0,0]
c[0] = A+B
c[1] = A-B
c[2] = A*B

print(max(c))

Submission status: Accepted

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

ad = A + B
sb = A - B
ml = A * B

print(max(ad, sb, ml))

Submission status: Accepted

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

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>z:
    print(y)
else:
    print(z)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict as dd
from collections import Counter
from pprint import pprint as pp

YN = {True: 'Yes', False: 'No'}
ri = lambda: int(input())
ria = lambda: list(map(int, input().split()))
rian = lambda n: [ria() for _ in range(n)]
rs = lambda: input()
rsa = lambda: input().split()
rsn = lambda n: [rs() for _ in range(n)]

A,B = ria()
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:
import sys
if __name__ == "__main__":
    A, B = list(map(int, (input().split(' '))))
    a = A + B
    b = A - B
    c = A * B
    ans = max(a, b, c)
    print(ans)

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

main()

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(i) for i in input().split())
r1 = a + b
r2 = a * b
r3 = a - b
print(max(r1,r2,r3))

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

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

print(X)

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == "__main__":
    print(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())

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

main()

Submission status: Accepted

Solution code:
line = input().split(' ')
a = int(line[0])
b = int(line[1])
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
p = a * b

print(max(s,d,p))

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

A=[]

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

print(max(A))

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

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

print(max(x, y, z))

Submission status: Accepted

Solution code:

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


print(abc098_a())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
n, m = [int(i) for i in input().split()]

print(max(n-m, n+m, n*m))

Submission status: Accepted

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

Submission status: Accepted

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

# AtCoder Beginner Contest
# Problem A

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

Submission status: Accepted

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

Submission status: Accepted

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