#include <iostream>
#include <vector>

template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

constexpr int MOD = 924844033;
using mint = ModInt<MOD>;
using mints = std::vector<mint>;

template <class T>
struct Combination {
    int max_n;
    std::vector<T> f, invf;

    explicit Combination(int n)
        : max_n(n), f(n + 1), invf(n + 1) {
        f[0] = 1;
        for (int i = 1; i <= n; ++i) {
            f[i] = f[i - 1] * i;
        }

        invf[max_n] = f[max_n].inv();
        for (int i = max_n - 1; i >= 0; --i) {
            invf[i] = invf[i + 1] * (i + 1);
        }
    }

    T fact(int n) const { return f[n]; }
    T invfact(int n) const { return invf[n]; }
    T perm(int a, int b) const {
        return a < b || b < 0 ? T(0) : f[a] * invf[a - b];
    }
    T comb(int a, int b) const {
        return a < b || b < 0 ? T(0) : f[a] * invf[a - b] * invf[b];
    }
};

const Combination<mint> C(10000);

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

void solve() {
    int n, k;
    std::cin >> n >> k;

    mints pat(1, 1);
    // i個ルールを破るものの通り数
    for (int s = 0; s < k * 2; ++s) {
        auto dp = vec(2, vec(1, mint(0)));
        dp[0][0] = 1;
        // 直前で上を選んだか否か/i個ルールを破る

        for (int i = s; i < n; i += k * 2) {
            auto ndp = vec(2, vec(dp[0].size() + 1, mint(0)));

            for (int m = 0; m < (int)dp[0].size(); ++m) {
                // 何も選ばない
                ndp[0][m] += dp[0][m] + dp[1][m];

                // 下を選ぶ
                if (i >= k) ndp[0][m + 1] += dp[0][m];

                // 上を選ぶ
                if (i + k < n) ndp[1][m + 1] += dp[0][m] + dp[1][m];
            }

            std::swap(dp, ndp);
        }

        int m = pat.size(), l = dp[0].size();
        mints npat(m + l - 1, 0);
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < l; ++j) {
                npat[i + j] += pat[i] * (dp[0][j] + dp[1][j]);
            }
        }

        std::swap(pat, npat);
    }

    mint ans = 0;
    for (int i = 0; i <= n; ++i) {
        ans += pat[i] * C.fact(n - i) * (i % 2 == 0 ? 1 : -1);
    }
    std::cout << ans << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}


Measured memory_bytes: 384