#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)
{
    return fact(n)*inv(fact(n-k))%mod*inv(fact(k))%mod;
}
int main()
{
    int n,k;
    fin>>n>>k;
    fout<<C(n%(k-1),n-k+1);
    return 0;
}