#include <iostream>
using namespace std;

int ans = 0;

void dfs(int start, int rest, int cnt)
{
    if(cnt == 1)
    {
        ans++;
        return;
    }
    
    for(int i = start; i <= rest / cnt; ++i)
    {
        dfs(i, rest - i, cnt - 1);
    }
}

int main()
{
    int n, k;
    cin >> n >> k;
    ans = 0;
    dfs(1, n, k);
    cout << ans << endl;
    return 0;
}