#include <iostream>
using namespace std;

int n,m;
const int N = 35;
int dp[N][N];


int main(){

    cin>>n>>m;
    dp[0][1] = 1;
    for(int i = 1;i<=n;i++)
        for(int j = 1;j<=m;j++) 
        {
            if(i % 2 == 0 && j % 2 == 0)
                dp[i][j] = 0;
            else
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
        }
    cout<<dp[n][m]<<endl;
    return 0;
}