#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    long long n,m,count=0;
    cin>>n>>m;
    if(n<m)
        {
        count=n-1;
        count=count + n*(m-1);
    }
    else
        {
        count=m-1;
        count=count + (n-1)*m;
    }
    cout<<count;
    return 0;
}