#include <bits/stdc++.h>
#define MOD 2000003
#define int long long

using namespace std;

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

int Invers (int x) {
  int exp = MOD - 2, ans = 1;
  while (exp) {
    if (exp & 1)
      ans = (ans * x) % MOD;
    x = (x * x) % MOD;
    exp /= 2;
  }
  return ans % MOD;
}

int Factorial (int n) {
  if (n == 0)
    return 1;
  return (n * Factorial (n - 1)) % MOD;
}

int N, K;

int32_t main () {
  fin >> N >> K;
  if (N <= K)
    fout << "1\n";
  else {
    int ans1 = Factorial (N - 1) % MOD, ans2 = Invers (Factorial ((N - 1) % (K - 1)) * Factorial (N - 1 - (N - 1) % (K - 1)) % MOD) % MOD;
    fout << (ans1 * ans2) % MOD;
  }

}