#include <bits/stdc++.h>
#pragma GCC optimize ("O3")

using namespace std;

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

const int mod = 666013;
int n, k, r, c, fact[5002];

int logpow (int a, int b) {
  int p = 1;
  while (b) {
    if (b & 1)
      p = 1ll * p * a % mod;
    a = 1ll * a * a % mod;
    (b >>= 1);
  }
  return p;
}

int main()
{
  fin >> n >> k;
  if (k % 2 == 0) {
    fout << 0;
    return 0;
  }
  r = n % k;
  c = n / k;
  fact[0] = 1;
  for (int i = 1; i <= n;  i++)
    fact[i] = 1ll * fact[i - 1] * i %  mod;
  int ans = fact[r];
  ans = 1ll * ans * fact[k - r] % mod;
  ans = 1ll * ans * logpow(fact[c + 1], r) % mod;
  ans = 1ll * ans * logpow(fact[c], k - r) % mod;
  fout << ans;
  return 0;
}