#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define int long long

 #define maxn 200+10

 #define rep(i,s,e) for(register int i=s;i<=e;++i)

 #define dwn(i,s,e) for(register int i=s;i>=e;--i)

 using namespace std;

 inline int read()

 {

     int x=,f=;

     char c=getchar();

     while(c<''||c>'') {if(c=='-') f=-; c=getchar();}

     while(c>=''&&c<='') {x=x*+c-''; c=getchar();}

     return f*x;

 }

 inline void write(int x)

 {

     if(x<) {putchar('-'); x=-x;}

     if(x>) write(x/);

     putchar(x%+'');

 }

 int n,k,ans;

 int a[maxn];

 void dfs(int step)

 {

     if(n==) return;

     if(k==step)

     {

         if(n<a[step-]) return;

         ans++;

         return;

     }

     rep(i,a[step-],n/(k-step+))

     {

         a[step]=i;

         n-=i;

         dfs(step+);

         n+=i;

     }

 }

 signed main()

 {

     n=read();k=read();

     a[]=;

     dfs();

     write(ans);

     return ;

 }