#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>

using namespace std;

const int N = 40;
int f[N][N];

int main()
{
    int n ,m;
    cin >> n >> m;
    for(int i = 1 ; i <= n ; i ++ ) f[i][1] = 1;
    for(int j = 1 ; j <= m ; j ++ ) f[1][j] = 1;

    for(int i = 2 ; i <= n ; i ++ )
        for(int j = 2 ; j <= m ; j ++ )
         if(i % 2 || j % 2)
           f[i][j] = f[i - 1][j] + f[i][j - 1];

    cout << f[n][m] << endl;

    return 0;
}