#include <cstdio>
#include <queue>

using namespace std;

int g[4][2] = 
{
	{-2, 1}, {-1, 2},
	{1, 2}, {2, 1}
};

int f[25][25], m, n;

int dfs(int x, int y)
{
	if (x < 1 || y < 1 || x > m || y > n)
		return 0;
	if (x == m && y == n)
		return 1;
	if (f[x][y])
		return f[x][y];
	for (int i = 0; i < 4; i++)
		f[x][y] += dfs(x + g[i][0], y + g[i][1]);
	return f[x][y];
}

int main()
{
	freopen("horse.in", "r", stdin);
	freopen("horse.out", "w", stdout);
	
	scanf("%d %d", &m, &n);
	printf("%d", dfs(1, 1));
	return 0;
}