http://www.lydsy.com/JudgeOnline/problem.php?id=3398
rank 1! hhhhhhhh
#include <cstdio>
using namespace std;
/************************************************
Code By willinglive
************************************************/
/
#define rep(i,l,r) for(int i=l,___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=r,___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int getint()
{
int r=0,k=1;char c=getchar();
for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';
return k*r;
}
/
const int mod=5000011;
int n,k;
/
LL pow_mod(LL a,int b){LL t=1;for(;b;b>>=1,a=(a*a)%mod)if(b&1)t=(t*a)%mod;return t;}
inline LL C(int n,int m)
{
if(m+m>n) m=n-m;
LL s1=1,s2=1;
rep(i,1,m) s1=(s1*(n-i+1))%mod;
rep(i,1,m) s2=(s2*i)%mod;
return (s1*pow_mod(s2,mod-2))%mod;
}
/
int main()
{
n=getint(); k=getint();
int ans=0;
rep(i,0,(n-1)/(k+1)+1)
{
ans=(ans+C(n-(i-1)*k,i))%mod;
//printf("%d\n",ans);
}
printf("%d\n",ans);
return 0;
}