output_description: Print the largest number among A + B, A - B, and A \times B.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B
attempt: # -*- coding: utf-8 -*-
  
  import sys
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def list2d(a, b, c):
      return [[c] * b for i in range(a)]
  
  
  def list3d(a, b, c, d):
      return [[[d] * c for j in range(b)] for i in range(a)]
  
  
  def ceil(x, y=1):
      return int(-(-x // y))
  
  
  def INT():
      return int(input())
  
  
  def MAP():
      return map(int, input().split())
  
  
  def LIST():
      return list(map(int, input().split()))
  
  
  def Yes():
      print("Yes")
  
  
  def No():
      print("No")
  
  
  def YES():
      print("YES")
  
  
  def NO():
      print("NO")
  
  
  sys.setrecursionlimit(10**9)
  INF = float("inf")
  MOD = 10**9 + 7
  
  A, B = MAP()
  
  print(max(A + B, A - B, A * B))
  
problem_description: Statement
  
  We have two integers: A and B.
  
  Print the largest number among A + B, A - B, and A \times B.
samples: [{"input": "-13 3", "output": "-10\n    \n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is\n-10.\n\n* * *"}, {"input": "1 -33", "output": "34\n    \n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\n* * *"}, {"input": "13 3", "output": "39\n    \n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39."}]