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.

Solution in C (GCC 5.4.1) (judge verdict: Runtime Error)

#include<stdio.h>
int main()
{
    int N;
    int i,j,k;
    char c;
    int co = 0;
    int con = 0;


    scanf("%d", &N);

    int list[N][26];

    int ca[N];

    int cc[10];

    for(i = 0; i < N; i++){
        for(j = 0; j < 26; j++){
            list[i][j] = 0;
        }

        for(j = 0; j < 10; j++){
            scanf("%c",&c);
            if(c < 'a' || c > 'z'){
                j--;
                continue;
            }
            list[i][c-'a']++;
            cc[j] = c-'a';
        }
        con = 0;

        for(j = i - 1 ; j >= 0; j--){
            for(k = 0; k < 10; k++){
                if(list[i][cc[k]] != list[j][cc[k]]){
                    con--;
                    break;
                }
            }
            con++;
            if(con){
                con = ca[j] + 1;
                break;
            }
        }

        ca[i] = con;
        co += con;

    }
    printf("%d",co);


    return 0;
}