#include <iostream>
using namespace std;

int a,b,sum,dif,tim;

int main(){
	cin >> a >> b;
	sum = a + b;
	dif = a - b;
	tim = a * b;
	if((sum > dif)&&(sum > tim)){
		cout << sum;
	}else{
		if(dif > tim){
			cout << dif;
		}else{
			cout << tim;
		}
	}
	cout << endl;
}
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <iomanip>

using namespace std;
using ll = long long;

#define rep(i,N) for(int i=0;i<(int)N;++i)

ll GCD(ll x, ll y) {
    if (y == 0) return x;
    else return GCD(y, x % y);
}


#include <iostream>

int main()
{
    int A, B;
    cin >> A >> B;

    int C = A + B;
    int D = A - B;
    int E = A * B;

    cout << max(C,max(D,E)) << endl;
}
