#include <bits/stdc++.h>
#define mod 2000003
using namespace std;
int v[5003],n,k;
int comb(int n,int k)
{
	v[0]=1;
	if(k>n) return 1;
	for(int i=1;i<=n;++i)
    {
        for(int j=i;j>=1;--j) v[j]=(v[j]+v[j-1])%mod;
    }
	return v[k];
}
int main ()
{
	freopen("sandokan.in","r",stdin);
	freopen("sandokan.out","w",stdout);
	scanf("%d%d",&n,&k);
	printf("%d\n",comb(n-1,(n-1)%(k-1)));
	return 0;
}