#include <bits/stdc++.h>
using namespace std;

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

constexpr int NMAX = 2000, MOD = 2e6 + 3;
bool a[NMAX + 10][NMAX + 10];

long long lgput(long long a, long long b) {
    long long ans = 1;
    while (b) {
        if (b % 2 == 1) ans = (ans * a) % MOD;
        a = (a * a) % MOD;
        b /= 2;
    }
    return ans;
}

long long C(long long n, long long k) {
    long long ans = 1;
    for (long long i = n - k + 1; i <= n; i++) {
        ans = (ans * i) % MOD;
    }

    long long kfact = 1;
    for (long long i = 2; i <= k; i++) {
        kfact = (kfact * i) % MOD;
    }

    long long kfactinv = lgput(kfact, MOD - 2);

    ans = (ans * kfactinv) % MOD;
    return ans;
}

int main() {
    long long n, k;
    fin >> n >> k;

    long long ans = 1;
    while (n >= k) {
        ans = (ans * C(n, k)) % MOD;
        n -= k - 1;
    }

    fout << ans;
}