#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define Ans(f, y, n) if(f) cout << y << endl; else cout << n << endl;
#define int long long
#define INF 1000000000000000000
using namespace std;

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;

template<typename T>
void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }
void readi(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }
template<typename T>
void debug(vector<vector<T>> m){ REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;} }

int modpow(int x, int n, int m){
    int a = 1;
    IREP(i, 64){
        a = (a * a) % m;
        if(((n >> i) & 1) == 1) a = (a * x) % m;
    }
    return a;
}

class Combination
{
public:

    vec fact, invfact;
    int MAX_N, mod;

    Combination(int MAX_N, int mod): MAX_N(MAX_N), mod(mod) {
        initialize();
    }

    void initialize(){
        fact = vec(MAX_N + 1);
        invfact = vec(MAX_N + 1);
        fact[0] = 1;
        FOR(i, 1, MAX_N + 1){
            fact[i] = (fact[i - 1] * i) % mod;
        }
        invfact[MAX_N] = modpow(fact[MAX_N], mod - 2, mod);
        IREP(i, MAX_N){
            invfact[i] = (invfact[i + 1] * (i + 1)) % mod;
        }
    }

    int nCr(int n, int r){
        if(r > n || r < 0 || n < 0) return 0;
        if(n > MAX_N){
            MAX_N = n;
            initialize();
        }
        int a = fact[n];
        a = (a * invfact[r]) % mod;
        a = (a * invfact[n - r]) % mod;
        return a;
    }

    int nPr(int n, int r){
        if(r > n || r < 0 || n < 0) return 0;
        if(n > MAX_N){
            MAX_N = n;
            initialize();
        }
        int a = fact[n];
        a = (a * invfact[n - r]) % mod;
        return a;
    }
};

signed main(){

    int N, K; cin >> N >> K;
    int mod = 924844033;
    Combination comb(N + 1, mod);

    vector<mat> dp(N + 1, mat(N + 1, vec(2, 0)));
    dp[0][0][0] = 1;
    int i0 = 0;
    REP(s, 2 * K){
        int n = s;
        REP(j, N + 1){
            dp[i0][j][0] += dp[i0][j][1];
            dp[i0][j][0] %= mod;
            dp[i0][j][1] = 0;
        }
        while(n < N){
            //左
            if(n - K >= 0){
                REP(j, N) dp[i0 + 1][j + 1][0] += dp[i0][j][0];
            }
            //なし
            REP(j, N + 1) dp[i0 + 1][j][0] += dp[i0][j][0] + dp[i0][j][1];
            //右
            if(n + K < N){
                REP(j, N) dp[i0 + 1][j + 1][1] += dp[i0][j][0] + dp[i0][j][1];
            }

            REP(j, N + 1){
                dp[i0 + 1][j][0] %= mod;
                dp[i0 + 1][j][1] %= mod;
            }
            n += 2 * K;
            i0++;
        }
    }
    //debug(dp[N]);
    int ans = 0;
    REP(i, N + 1){
        if(i % 2 == 0) ans += (dp[N][i][0] + dp[N][i][1]) * comb.fact[N - i];
        else ans -= (dp[N][i][0] + dp[N][i][1]) * comb.fact[N - i];
        ans = (ans % mod + mod) % mod;
    }
    cout << ans << endl;
    
    return 0;
}

Measured memory_bytes: 219392