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:
# ALC008 A

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

print(list[0])

Submission status: Accepted

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

print(List[2])

Submission status: Accepted

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

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

print(ans)

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

lst = []

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

print(max(lst))

Submission status: Accepted

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

Submission status: Accepted

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

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

s = sorted([x, y, z])
print(s[-1])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

results = []

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

print(max(results))

Submission status: Accepted

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

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 = 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()))
a, b, c = A+B, A-B, A*B
h = [a, b, c]
maxvalue = -10**7
for i in range(len(h)):
    if h[i] > maxvalue:
        maxvalue = h[i]
print(maxvalue)

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
# import numpy as np
# import scipy as sp
# print(a,b,c,sep="") # 半角スペースなしで出力(abc)
# n=int(input())  #数値入力 「N」だけの入力のとき
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# c=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# s=[list(map(int,list(input()))) for i in range(h)]  # 文字列の二次元配列入力
# s = [list(map(int, input().split())) for i in range(n)] # 数値の二次元配列入力
# import sys ; sys.exit() # プログラム終了
# from copy import deepcopy ; b=deepcopy(a)
# chr(ord('a') + 1)
# s.sort(key=lambda x: x[1], reverse=False) # 2番目の要素で昇順にソート（Trueなら降順）
#

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

Submission status: Accepted

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

a = arr[0]
b = arr[1]


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

Submission status: Accepted

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

print(l[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:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b = map(int,input().split())
print(max([a+b,a*b,a-b]))

Submission status: Accepted

Solution code:

n,q = map(int,input().split())

a = n + q
b = n - q
c = n * q
print(max(a,b,c))

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 24, Jan, 2020
"""

import sys

# import numpy as np

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

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    setrecursionlimit(10**6)
    r = stdin.readline()[:-1]
    #n = int(stdin.readline()[:-1])   
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]

    res = 0
    a, b = map(int, r.split())
    print(max(a+b,a-b,a*b))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

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

print(max(calc))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

result = sorted(calArray,reverse=True)

print(result[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
A,B = [int(i) for i in input().split()]
p = A + B
m = A - B
b = A* B
print(max(p,m,b))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

# A + B
x = [a + b]
# A - B
x.append(a - b)
# A * B
x.append(a * b)
print(max(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:
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)

Submission status: Accepted

Solution code:
import sys
import math
import numpy as np
input = sys.stdin.readline
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_v = -10**9
tmp = A + B
max_v = tmp if max_v < tmp else max_v
tmp = A - B
max_v = tmp if max_v < tmp else max_v
tmp = A * B
max_v = tmp if max_v < tmp else max_v
print(max_v)

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a, b = map(int, sys.stdin.readline().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 = list(map(int,input().split()))
print(max([A+B,A-B,A*B]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B = map( int, input().split() )
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 = [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())
wa=A+B
sa=A-B
seki=A*B
kotae=max(wa,sa,seki)
print(kotae)

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:
string = input()
print(max(eval(string.replace(" ", op)) for op in ["+", "-", "*"]))

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))
 
 
n,k = map(int,input().split())
print(max(n+k,n-k,n*k))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b=INTM()
    print(max(a*b,a+b,a-b))
if __name__ == '__main__':
    do()

Submission status: Accepted

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

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

Submission status: Accepted

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


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
#098a 13:09 - 13:10
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:
# ABC098a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

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:
def inpl(): return list(map(int, input().split()))
A, B = inpl()
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:
nums = list(map(int, input().split())) # "1 2 3"と入力

a = nums[0]
b = nums[1]

sums = a + b
diff = a - b
kakeru = a * b

ans = max(sums,diff,kakeru)

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:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

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

Submission status: Accepted

Solution code:
##### 解けた #####

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

Submission status: Accepted

Solution code:
def examA():
    A, B = LI()
    ans = max(A+B,A-B,A*B)
    print(ans)


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Submission status: Accepted

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

#入力
#S = str(input())
A, B = map(int, input().split())
#N = int(input())

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

print (list[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

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

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

AaddB = (A+B)
AminuseB = (A-B)
AtimseB = (A*B)

print(max(AaddB,AminuseB,AtimseB))

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:
#!/usr/bin/env python3

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



if __name__ == "__main__":
    main()

Submission status: Accepted

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

ans = list()
ans.append(A+B)
ans.append(A-B)
ans.append(A*B)
print(max(ans))

Submission status: Accepted

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

A, B = list(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())
D = A + B
E = A - B
F = A * B
print(max(D, E, F))

Submission status: Accepted

Solution code:
from sys import stdin
import bisect

a,b = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

plus = A + B
mat = A * B
sub = A - B
print(max(plus, mat, sub))

Submission status: Accepted

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

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:
import sys
def input(): return sys.stdin.readline().strip()

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

main()

Submission status: Accepted

Solution code:
#                         author:  kagemeka 
#                         created: 2019-11-07 23:33:56(JST)
## internal modules
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
## external modules
# import scipy.special   # if use comb function on AtCoder, 
# import scipy.misc      # select scipy.misc.comb (old version) 

def main():
    a, b = (int(x) for x in sys.stdin.readline().split())
    ans = max(a + b, a - b, a * b)
    print(ans)
    


if __name__ == "__main__":
    # execute only if run as a script
    main()

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=[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:
#Add Sub Mal
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())

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

Submission status: Accepted

Solution code:
import sys

#+++++
		
def main():
	a,b = map(int, input().split())
	ans=max(a+b,a-b,a*b)
	print(ans)
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

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

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

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())
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
g = max(d,e,f)
print(g)

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

print(max(l))

Submission status: Accepted

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

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

Submission status: Accepted

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

print(max(d,s,m))

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(x) for x in input().split())
print(max(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 = (int(x) for x in input().split())

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

print(max(result))

Submission status: Accepted

Solution code:

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



if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

Solution code:
s=input()
S=s.split()
a=0
b=0
c=0
a=int(S[0])+int(S[1])
b=int(S[0])-int(S[1])
c=int(S[0])*int(S[1])
if a>=b and a>=c:
    print(a)
elif b>=a and b>=c:
    print(b)
elif c>=a and c>=b:
    print(c)

Submission status: Accepted

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

print(str(max(int(x[0])+int(x[1]),int(x[0])*int(x[1]),int(x[0])-int(x[1]))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, 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())
num = [a+b,a-b,a*b]
print(max(num))

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

li=[]

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

ans=sorted(li)

print(ans[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2019/09/26
A, B = map(int, input().split())

# try:
#     print(max(A+B, A-B, A*B, A/B))
# except ZeroDivisionError:
#     print(max(A+B, A-B, A*B))

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

Submission status: Accepted

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

s1 = a + b
s2 = a - b
s3 = a * b

print(max(s1,s2,s3))

Submission status: Accepted

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

aa098()

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

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(x) for x in 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())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

result=[]

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

print(max(result))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#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:
s=list(input().split())
a=int(s[0])
b=int(s[1])
sum=a+b
minus=a-b
kakeru=a*b

print(max(sum,minus,kakeru))

Submission status: Accepted

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

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

print(max(answers))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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