3003

#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

int main() {
    ifstream fin("input.txt");
    ofstream fout("output.txt");

    int n, k;
    fin >> n >> k;
    vector<vector<int>> dp(n + 1, vector<int>(k + 1));
    for (int i = 0; i <= k; i++) dp[0][i] = 1;

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= k; j++)
            dp[i][j] = dp[i][j - 1] + (i >= j ? dp[i - j][j] : 0);

    fout << dp[n][k] << endl;

    fin.close();
    fout.close();
    return 0;
}