/*by SilverN*/

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<cmath>

 using namespace std;

 int cnt;

 int n,k;

 void DFS(int r,int dep,int last){

     if(dep==){

         if(r==last || r>last)cnt++;

         return;

     }

     for(int i=last;i<=r/dep;i++){

         DFS(r-i,dep-,i);

     }

     return;

 }

 int main(){

     cin>>n>>k;

     DFS(n,k,);

     cout<<cnt<<endl;

     return ;

 }