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

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <functional>
#include <map>
using namespace std;

#pragma warning(disable:4996)

typedef long long ll;
typedef pair<ll, ll> pll;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1000000007;

int main() {
	int A, B;
	scanf("%d %d", &A, &B);
	int mx = max({ A + B, A - B, A*B });
	return !printf("%d\n", mx);
}