#include <iostream>
#include <string>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PI (ld)3.14159265358979324
#define mp make_pair 
#define pb push_back
#define ft first
// #define sd second
#define sz(a) (ll)a.size()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define loop(i, n) for(int (i) = 0; (i) < (n) ; ++ (i))
#define forn(i, l, r) for(int (i) = (l); (i) < (r) ; ++ (i))
#define vec vector 
#define str string
/*******************************************************/

void solve() {
    ll n,m;
    cin >> n >> m;
    ll a = m-1ll + (n - 1ll)*m;
    ll b = n-1ll + (m - 1ll)*n;
    cout << min(a,b)<<endl;           
}

int main()
{
    // freopen("in.txt","r", stdin);
    ios_base::sync_with_stdio(false);   
    // cout << fixed;
    // cout.precision(3);

    solve();
    return 0;
}