#include <iostream>
#include <cstdio>
using namespace std;
const int N = 35;

int f[N][N];

int main()
{
    int n, m;
    scanf("%d %d", &n, &m);
    f[1][1] = 1;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            if (i%2 == 0 && j%2 == 0)
                continue;
            f[i][j] += f[i-1][j] + f[i][j-1];
        }
    }
    cout << f[n][m];
    return 0;
}