#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> dp(n + 1, vector<int>(m + 1, 0));
if ((1 % 2 == 0) && (1 % 2 == 0)) {
dp[1][1] = 0;
} else {
dp[1][1] = 1;
}
for (int i = 2; i <= n; ++i) {
if ((i % 2 == 0) && (1 % 2 == 0)) {
dp[i][1] = 0;
} else {
dp[i][1] = dp[i - 1][1];
}
}
for (int j = 2; j <= m; ++j) {
if ((1 % 2 == 0) && (j % 2 == 0)) {
dp[1][j] = 0;
} else {
dp[1][j] = dp[1][j - 1];
}
}
for (int i = 2; i <= n; ++i) {
for (int j = 2; 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;
}
