#include<cstdio>
#define MOD 2000003
int n,k,a[5005],c[2][5005];
void read()
{
    freopen("sandokan.in","r",stdin);
    freopen("sandokan.out","w",stdout);
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
}
void solve()
{
    int p=n%(k-1);
    if(p==0) p=k-1;
    c[1][0]=1;
    c[1][1]=1;
    for(int i=2;i<n;i++)
    {
        c[i%2][0]=1;
        for(int j=1;j<=i;j++)
            c[i%2][j]=(c[(i-1)%2][j-1]+c[(i-1)%2][j])%MOD;
    }
    printf("%d",c[(n-1)%2][p-1]);
}
int main()
{
    read();
    solve();
    return 0;
}