//国际大学生程序设计竞赛例题解(三)
//动态规划
//Page 110
#include <iostream>
#include <cstdio>
using namespace std;
const int MAXSIZE = 100;
int f[MAXSIZE][MAXSIZE];
int main()
{
int x, y;
for(int i = 0; i < MAXSIZE; i++)
{
f[0][i] = 1;
f[i][0] = 1;
}
for(int i = 1; i < MAXSIZE; i++)
for(int j = 1; j < MAXSIZE; j++)
{
f[i][j] = f[i - 1][j] + f[i][j - 1];
}
cin >> x >> y;
cout << f[x][y] << endl;
return 0;
}