#include <bits/stdc++.h> using namespace std; int cnt; void dfs(int n,int k,int min_num) { if(k==1) { cnt++; return; } for(int now_num=min_num;now_num<=n/k;now_num++) { dfs(n-now_num,k-1,now_num); } } int main() { int n,k; cin>>n>>k; dfs(n,k,1); cout<<cnt; return 0; }