#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void mmax(T &m, const T q) { if (m < q) m = q; }
template<typename T> void mmin(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

constexpr lint MOD = 924844033;

int N, K;

vector<vector<lint>> ves;

vector<lint> solve(int n)
{
    vector<vector<lint>> dp;
    ndarray(dp, n + 1, n + 1);
    dp[0][0] = dp[1][0] = dp[1][1] = 1;
    FOR(d, 2, n + 1)
    {
        REP(used, d + 1)
        {
            dp[d][used] = dp[d - 1][used];
            if (d > 1 and used) (dp[d][used] += dp[d - 2][used - 1]) %= MOD;
        }
    }
    vector<lint> res((n + 1) / 2 + 1);
    REP(d, res.size()) res[d] = dp[n][d];
    return res;
}


vector<lint> fac, facInv, inv;
void facInit(int nmax)
{
    fac = facInv = inv = vector<lint>(nmax + 1, 1);
    for (int i = 2; i <= nmax; i++)
    {
        fac[i] = fac[i-1] * i % MOD;
    }
}

vector<lint> pattern;
int main()
{
    cin >> N >> K;
    facInit(N);

    FOR(l, 1, K + 1)
    {
        int n = (N - l) / K;
        if (n == 0) continue;
        vector<lint> v = solve(n);
        ves.push_back(v);
        ves.push_back(v);
    }

    pattern.resize(1);
    pattern[0] = 1;
    for (auto vec : ves)
    {
        vector<lint> pattern2(pattern.size() + vec.size() - 1);
        REP(i, vec.size()) if (vec[i])
        {
            REP(j, pattern.size()) (pattern2[i + j] += vec[i] * pattern[j]) %= MOD;
        }
        swap(pattern, pattern2);
    }

    lint res = 0;
    REP(n, pattern.size())
    {
        lint tmp = fac[N - n] * pattern[n] % MOD;
        if (n % 2) tmp = MOD - tmp;
        (res += tmp) %= MOD;
    }
    cout << res << endl;
    return 0;
}


Measured memory_bytes: 31616