#include <bits/stdc++.h>

using namespace std;
ifstream fin("sandokan.in");
ofstream fout("sandokan.out");
int mod=2000003;
int fact(int n)
{
    int res=1;
    for(int i=2;i<=n;i++)
        res=(1ll*res*i)%mod;
    return res;
}
int power(long long base,int power)
{
    long long res=1;
    while(power)
    {
        if(power%2)
        {
            res*=base;
            res%=mod;
        }
        power/=2;
        base*=base;
        base%=mod;
    }
    return res;
}
int inv(int n)
{
    return pow(n,mod-2);
}
int C(int n,int k)
{
    if(k>n)
        return 0;
    return fact(n)*inv(fact(n-k))%mod*inv(fact(k))%mod;
}
int v[5001];
int main()
{
    int n,k,x;
    int res=0;
    fin>>n>>k;
    int ramase=n;
    while(ramase>=k)
        ramase-=(k-1);
    for(int i=1;i<=n;i++)
    {
        res+=C(i-k,ramase-1);
        res%=mod;
    }
    fout<<res;
    return 0;
}