#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 2005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
	if(c == '-') f = -1;
	   c = getchar();
    }
    while(c >= '0' && c <= '9') {
    	res = res * 10 +c - '0';
    	c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
    	out(x / 10);
    }
    putchar('0' + x % 10);
}
const int MOD = 924844033,g = 5,MAXL = (1 << 15);

int N,K;
int a[MAXN],W[MAXL + 5],f[2][MAXN][2],p[MAXL + 5];
int ans[MAXL + 5],fac[MAXN];
int inc(int a,int b) {
    return a + b >= MOD ? a + b - MOD : a + b;
}
int mul(int a,int b) {
    return 1LL * a * b % MOD;
}
void update(int &x,int y) {
    x = inc(x,y);
}
int fpow(int x,int c) {
    int res = 1,t = x;
    while(c) {
        if(c & 1) res = mul(res,t);
        t = mul(t,t);
        c >>= 1;
    }
    return res;
}
void NTT(int *p,int L,int on) {
    for(int i = 1 , j = L >> 1 ; i < L - 1 ; ++i) {
        if(i < j) swap(p[i],p[j]);
        int k = L >> 1;
        while(j >= k) {
            j -= k;
            k >>= 1;
        }
        j += k;
    }
    for(int h = 2 ; h <= L ; h <<= 1) {
        int wn = W[(MAXL + on * MAXL / h) % MAXL];
        for(int k = 0 ; k < L ; k += h) {
            int w = 1;
            for(int j = k ; j < k + h / 2 ; ++j) {
                int u = p[j],t = mul(p[j + h / 2],w);
                p[j] = inc(u,t);
                p[j + h / 2] = inc(u,MOD - t);
                w = mul(w,wn);
            }
        }
    }
    if(on == -1) {
        int invL = fpow(L,MOD - 2);
        for(int i = 0 ; i < L ; ++i) p[i] = mul(p[i],invL);
    }
}
void Solve() {
    read(N);read(K);
    W[0] = 1;W[1] = fpow(g,(MOD - 1) / MAXL);
    for(int i = 2 ; i < MAXL ; ++i) W[i] = mul(W[i - 1],W[1]);
    int len = 1;
    while(len <= N) len <<= 1;
    ans[0] = 1;
    NTT(ans,len,1);
    for(int i = 1 ; i <= 2 * K ; ++i) {
        memset(f,0,sizeof(f));
        int cur = 0;
        f[cur][0][0] = 1;int cnt = 0;
        for(int j = i ; j <= N ; j += 2 * K) {
            memset(f[cur ^ 1],0,sizeof(f[cur ^ 1]));
            for(int h = 0 ; h <= cnt ; ++h) {
                update(f[cur ^ 1][h][0],inc(f[cur][h][0],f[cur][h][1]));
                if(j - K >= 1) update(f[cur ^ 1][h + 1][0],f[cur][h][0]);
                if(j + K <= N) update(f[cur ^ 1][h + 1][1],inc(f[cur][h][0],f[cur][h][1]));
            }
            ++cnt;
            cur ^= 1;
        }
        memset(p,0,sizeof(p));
        for(int j = 0 ; j <= N ; ++j) {
            p[j] = inc(f[cur][j][0],f[cur][j][1]);
        }
        NTT(p,len,1);
        for(int j = 0 ; j < len ; ++j) {
            ans[j] = mul(ans[j],p[j]);
        }
    }
    NTT(ans,len,-1);
    fac[0] = 1;
    for(int i = 1 ; i <= N ; ++i) fac[i] = mul(fac[i - 1],i);
    int res = 0;
    for(int i = 0 ; i <= N ; ++i) {
        if(i & 1) update(res,MOD - mul(fac[N - i],ans[i]));
        else update(res,mul(fac[N - i],ans[i]));
    }
    out(res);enter;
}
int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}


Measured memory_bytes: 512