#include <bits/stdc++.h>

using namespace std;

const int MAXN = 205;
const int MAXK = 10;

int dp[MAXN][MAXK];

int main()
{
  int n,k;
  cin>>n>>k;

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