#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
#include <array>

template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { lhs = rhs; return true; }
  return false;
}

template <class T, class U>
inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { lhs = rhs; return true; }
  return false;
}

struct range {
  using int_ = int_fast64_t;
  struct itr {
    int_ i;
    constexpr itr(int_ i_): i(i_) { }
    constexpr void operator ++ () { ++i; }
    constexpr int_ operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr range(int_ l_, int_ r_): l(l_), r(std::max(l_, r_)) { }
  constexpr itr begin() const { return l; }
  constexpr itr end() const { return r; }
};

struct revrange {
  using int_ = int_fast64_t;
  struct itr {
    int_ i;
    constexpr itr(int_ i_): i(i_) { }
    constexpr void operator ++ () { --i; }
    constexpr int_ operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr revrange(int_ l_, int_ r_): l(l_ - 1), r(std::max(l_, r_) - 1) { }
  constexpr itr begin() const { return r; }
  constexpr itr end() const { return l; }
};

using i32 = int_fast32_t;
using i64 = int_fast64_t;
using u32 = uint_fast32_t;
using u64 = uint_fast64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

template <uint_fast32_t Modulus>
class modular {
public:
  using value_type = uint_fast32_t;
  using max_type = uint_fast64_t;

  static constexpr value_type mod = Modulus;
  static constexpr value_type mod_min = 1;
  static constexpr value_type mod_max = 2147483647;
  static_assert(mod >= mod_min, "invalid mod :: too small");
  static_assert(mod <= mod_max, "invalid mod :: too big");

  template <class T>
  static constexpr value_type normalize(T value_) {
    if (value_ < 0) {
      value_ = -value_;
      value_ %= mod;
      if (value_ == 0) return 0;
      return mod - value_;
    }
    return value_ % mod;
  }

private:
  value_type value;

public:
  constexpr modular(): value(0) { }
  template <class T>
  explicit constexpr modular(T value_): value(normalize(value_)) { }
  template <class T>
  explicit constexpr operator T() { return static_cast<T>(value); }

  constexpr value_type operator () () const { return value; }
  constexpr modular operator - () const { return modular(mod - value); }
  constexpr modular operator ~ () const { return inverse(); }

  constexpr value_type &extract() { return value; }
  constexpr modular inverse() const { return power(mod - 2); }
  constexpr modular power(max_type exp) const {
    modular res(1), mult(*this);
    while (exp > 0) {
      if (exp & 1) res *= mult;
      mult *= mult;
      exp >>= 1;
    }
    return res;
  }

  constexpr modular operator + (const modular &rhs) const { return modular(*this) += rhs; }
  constexpr modular& operator += (const modular &rhs) { 
    if ((value += rhs.value) >= mod) value -= mod; 
    return *this; 
  }

  constexpr modular operator - (const modular &rhs) const { return modular(*this) -= rhs; }
  constexpr modular& operator -= (const modular &rhs) { 
    if ((value += mod - rhs.value) >= mod) value -= mod; 
    return *this; 
  }

  constexpr modular operator * (const modular &rhs) const { return modular(*this) *= rhs; }
  constexpr modular& operator *= (const modular &rhs) { 
    value = (max_type) value * rhs.value % mod;
    return *this;
  }

  constexpr modular operator / (const modular &rhs) const { return modular(*this) /= rhs; }
  constexpr modular& operator /= (const modular &rhs) { return (*this) *= rhs.inverse(); }

  constexpr bool zero() const { return value == 0; }
  constexpr bool operator == (const modular &rhs) const { return value == rhs.value; }
  constexpr bool operator != (const modular &rhs) const { return value != rhs.value; }
  friend std::ostream& operator << (std::ostream &stream, const modular &rhs) {
    return stream << rhs.value;
  }

};

template <class T, std::size_t N>
class factorials {
public:
  using value_type = T;
  static constexpr std::size_t size = N;

public:
  std::array<value_type, size + 1> fact{};
  std::array<value_type, size + 1> fact_inv{};

  factorials() {
    fact.front() = value_type(1);
    for (std::size_t i = 1; i <= size; ++i) {
      fact[i] = fact[i - 1] * value_type(i);
    }
    fact_inv.back() = ~fact.back();
    for (std::size_t i = size; i > 0; --i) {
      fact_inv[i - 1] = fact_inv[i] * value_type(i);
    }
  }

  value_type operator () (std::size_t n, std::size_t r) const {
    return fact[n] * fact_inv[n - r] * fact_inv[r];
  }

};

using m32 = modular<924844033>;
factorials<m32, 2000> fact;

int main() {
  i32 N, K;
  std::cin >> N >> K;
  if (K > (N - 1) / 2) {
    m32 ans;
    i32 size = 2 * (N - K);
    for (auto i: range(0, size + 1)) {
      if (i & 1) ans -= fact(size, i) * fact.fact[N - i];
      else ans += fact(size, i) * fact.fact[N - i];
    }
    std::cout << ans << '\n';
  }
  else {
    std::vector<m32> dp(1, m32(1));
    for (auto i: range(0, 2 * K)) {
      i32 size = 0;
      for (auto j = i; j < N; j += 2 * K) {
        ++size;
      }
      std::vector<std::vector<std::vector<m32>>> ndp(size, std::vector<std::vector<m32>>(size + 1, std::vector<m32>(2)));
      ndp[0][0][0] = (m32) 1;
      if (i + K < N) ndp[0][1][1] = (m32) 1;
      if (i >= K) ndp[0][1][0] = (m32) 1;
      for (auto j: range(0, size - 1)) {
        for (auto k: range(0, j + 2)) {
          ndp[j + 1][k][0] += ndp[j][k][0];
          ndp[j + 1][k][0] += ndp[j][k][1];
          ndp[j + 1][k + 1][0] += ndp[j][k][0];
          if (i + (j + 1) * (2 * K) + K < N) {
            ndp[j + 1][k + 1][1] += ndp[j][k][0];
            ndp[j + 1][k + 1][1] += ndp[j][k][1];
          }
        }
      }
      std::vector<m32> nextdp(dp.size() + size);
      for (auto j: range(0, dp.size())) {
        for (auto k: range(0, size + 1)) {
          nextdp[j + k] += dp[j] * (ndp[size - 1][k][0] + ndp[size - 1][k][1]);
        }
      }
      dp = nextdp;
    }
    m32 ans;
    for (auto i: range(0, dp.size())) {
      if (i & 1) ans -= dp[i] * fact.fact[N - i];
      else ans += dp[i] * fact.fact[N - i];
    }
    std::cout << ans << '\n';
  }
}


Measured memory_bytes: 55140