Problem:


Score : 100 points

Problem Statement

We have two integers: A and B.

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

Constraints

All values in input are integers.

-100 \leq A,\ B \leq 100

Input

Input is given from Standard Input in the following format:

A B

Output

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

Sample Input 1

-13 3

Sample Output 1

-10

The largest number among A + B = -10, A - B = -16, and A \times B = -39 is -10.

Sample Input 2

1 -33

Sample Output 2

34

The largest number among A + B = -32, A - B = 34, and A \times B = -33 is 34.

Sample Input 3

13 3

Sample Output 3

39

The largest number among A + B = 16, A - B = 10, and A \times B = 39 is 39.



Sample input:
-13 3


Sample output:
-10

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

Submission status: Accepted

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

A, B = rl()

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

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
import math
import itertools
import collections
import heapq
import re
import numpy as np

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

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

Submission status: Accepted

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

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

print(max(plus, minus, by))

Submission status: Accepted

Solution code:
#create date: 2020-07-03 16:40

import sys
stdin = sys.stdin

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

num = [a, b, c]

max_num = max(num)


print(max_num)

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


if __name__ == "__main__":
    solve()

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

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

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

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

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

Submission status: Accepted

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

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

print(max(out1, out2, out3))

Submission status: Accepted

Solution code:
a,b=[int(x) for x in input().rstrip().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
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 = int(A + B)
b = int(A - B)
c = int(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:
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:
# -*- coding: utf-8 -*-

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

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

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

print(l[0])

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

Submission status: Accepted

Solution code:
# A - +-x
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 - +-x
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 = map(int,input().split())

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

Submission status: Accepted

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

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

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

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

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:
import sys
# from collections import defaultdict, deque
# import math
# import copy
# from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

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

INF = 10 ** 20
MOD = 1000000007

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

Submission status: Accepted

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

Submission status: Accepted

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

a,b = iim()
l = [a-b,a+b,a*b]
l.sort()
print(l[-1])

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

Submission status: Accepted

Solution code:
import sys

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


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

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(max_n)

Submission status: Accepted

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

Submission status: Accepted

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

main()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 137 A

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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
print(max(a,b,c))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(max(x))

Submission status: Accepted

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

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

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

print(max(list))

Submission status: Accepted

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

print(max(LAB))

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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


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


if __name__ == '__main__':
    solve()

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


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

Submission status: Accepted

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

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

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


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


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

Submission status: Accepted

Solution code:
import sys


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

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

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

Submission status: Accepted

Solution code:
x = input().split()
a = int(x[0])
b = int(x[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

#a = int(input())
#b = list(map(int, input().split()))
a, b = map(int, input().split())
#s = input()
#s,t = input().split()
#
#import sys
#sys.setrecursionlimit(10**6)
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]

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

Submission status: Accepted

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

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:
def main():
  num = list(map(int,input().split()))
  if num[0]+num[1]>num[0]-num[1]:
    if num[0]+num[1]>num[0]*num[1]:
      print(num[0]+num[1])
    else:
      print(num[0]*num[1])
  else:
    if num[0]-num[1]>num[0]*num[1]:
      print(num[0]-num[1])
    else:
      print(num[0]*num[1])
main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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
print(max(c,d,e))

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
d = a - b
e = a * b
print(max(c, d, 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())
x = a+b
y = a-b
z = a*b
lst = [x, y, z]
s_lst = sorted(lst)
print(s_lst[2])

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys


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


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

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

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
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]))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
x = A+B
y = A-B
z = A*B

if B>=0:
  if x - z >= 0:
    print(x)
  else:
    print(z)
else:
  if y - z >= 0:
    print(y)
  else:
    print(z)

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 solve():
  a, b = map(int, input().split())
  print(max(a+b, a-b, a*b))
  return 0
 
if __name__ == "__main__":
  solve()

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

S.sort(reverse=True)

print(S[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(x) for x 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())
x=a+b
y=a-b
z=a*b

list=[x,y,z]

print(max(list))

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
m = a - b
t = a * b

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def maxreturn(a, b):

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

if __name__ == '__main__':
    main()

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

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

print(max(r))

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

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

Submission status: Accepted

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

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

A,B = inputIL()

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:
# ABC137A

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

Submission status: Accepted

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

a,b=i2()
s=max(a+b,a-b,a*b)
print(s)

Submission status: Accepted

Solution code:
#from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

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

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

Submission status: Accepted

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

if __name__ == '__main__':

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

Submission status: Accepted

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