#include <bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 924844033
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li n;
li k;
// {pos, match_num, use_last}
li dp[4020][4020][2];

li fact[4040];

int main() {
    cin >> n >> k;

    dp[0][0][0] = 1;
    li next = 0;
    rep(i, min(n, 2 * k)) {
        rep(j, n + 1) {
            for (li x = i; x < n; x += 2 * k) {
                next = x + 2 * k;
                if (next >= n) {
                    next = i + 1;
                    if (next == min(n, 2 * k)) {
                        next = n;
                    }
                }
                // not use current edge
                dp[next][j][0] = (dp[next][j][0] + dp[x][j][0] + dp[x][j][1]) % MOD;
                // use x-k edge
                if (x >= k) {
                    dp[next][j + 1][0] = (dp[next][j + 1][0] + dp[x][j][0]) % MOD;
                }
                // use x+k edge
                if (x + k < n) {
                    if (next == i + 1 || next == n) {
                        dp[next][j + 1][0] = (dp[next][j + 1][0] + dp[x][j][0] + dp[x][j][1]) % MOD;
                    } else {
                        dp[next][j + 1][1] = (dp[next][j + 1][1] + dp[x][j][0] + dp[x][j][1]) % MOD;
                    }
                }
            }
        }
    }

    fact[0] = 1;
    rep(i, n) {
        fact[i + 1] = (fact[i] * (i + 1)) % MOD;
    }

    li res = 0;
    rep(i, n + 1) {
        if (i % 2 > 0) {
            //minus
            res = (res + MOD - (fact[n - i] * dp[n][i][0]) % MOD) % MOD;
        } else {
            res = (res + (fact[n - i] * dp[n][i][0]) % MOD) % MOD;
        }
    }
    cout << res << endl;

    return 0;
}

Measured memory_bytes: 126336