#include <bits/stdc++.h>

using namespace std;

ifstream in("sandokan.in");
ofstream out("sandokan.out");

const int MOD = 2e6 + 3, MAX = 5e3 + 5;
int fact[MAX];

void factorial(int n){
    fact[0] = 1;
    for(int i = 1; i <= n; i++)
        fact[i] = fact[i-1] * i % MOD;
}

int lgpow(int base, int exp){
    if(exp == 0)
        return 1;
    if(exp % 2)
        return base * lgpow(base, exp - 1) % MOD;
    return lgpow(base, exp / 2) * lgpow(base, exp / 2) % MOD;
}

int comb(int n, int k){
    if(k == 0)
        return 1;
    return fact[n] * lgpow(fact[k], MOD - 2) * lgpow(fact[n-k], MOD - 2) % MOD;
}

int main(){
    int n, k;
    in >> n >> k;
    n--;
    k--;
    factorial(n);
    out << comb(n, n%k);
}