#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<utility>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<deque>
#include<functional>
#include<climits>
#include<iomanip>
#define ll long long
#define pp pair<int,int>
#define ppl pair<ll,ll>
#define fi first
#define se second
#define tcase int t; scanf("%d",&t);
#define For(i,a,b) for(i = a; i < b; i++)
#define pb push_back
#define pq priority_queue
#define ve vector
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
using namespace std;
int main()
{

  ll i,j,k,x,y,z,fl,sum,count,n,m;

  cin>>n>>m;

  x = (n-1) + (m-1)*n;
  y = (m-1) + (n-1)*m;

  cout<<min(x,y);
 


  return 0;
}