#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

const int M = 924844033;

int pw(int a, int n = M - 2) {
    int ret = 1;
    while (n) {
        if (n & 1)
            ret = (ll) ret * a % M;
        a = (ll) a * a % M;
        n >>= 1;
    }
    return ret;
}

const int N = 4020;

int fact[N];
int rfact[N];

void init() {
    fact[0] = 1;
    for (int i = 1; i < N; ++i) {
        fact[i] = (ll) i * fact[i - 1] % M;
    }
    rfact[N - 1] = pw(fact[N - 1]);
    for (int i = N - 2; i >= 0; --i) {
        rfact[i] = (ll) (i + 1) * rfact[i + 1] % M;
    }

}

int n, k;

vi verts[N];

int dp[2][N][2];

void insum(int & a, int b) {
    a = (a + b) % M;
}

void smain() {

    init();

    cin >> n >> k;
    int md = 2 * k;

    for (int i = 1; i <= n; ++i) {
        verts[i % md].push_back(i);
//        cnt[i % md]++;
    }
    vi mdp(n + 1, 0);
    mdp[0] = 1;

    for (int r = 0; r < md; ++r) {
        if (verts[r].empty())
            continue;
        int s = verts[r].size();
        int pr = 0, cr = 1;
        fori (i, 2) {
            fori (j, s + 1) {
                fori (k, 2) {
                    dp[i][j][k] = 0;
                }
            }
        }
        dp[pr][0][0] = 1;

        for (int i = 0; i < s; ++i) {
            for (int cnt = 0; cnt < s; ++cnt) {
                for (int lst = 0; lst < 2; ++lst) {
                    /* do nothing */;
                    insum(dp[cr][cnt][0], dp[pr][cnt][lst]);
                    /* -k */;
                    if (verts[r][i] - k > 0 && lst == 0) {
                        insum(dp[cr][cnt + 1][0], dp[pr][cnt][lst]);
                    }
                    /* +k */;
                    if (verts[r][i] + k <= n)
                        insum(dp[cr][cnt + 1][1], dp[pr][cnt][lst]);
                    dp[pr][cnt][lst] = 0;
                }
            }
            swap(pr, cr);
        }

        vi cdp(n + 1, 0);

        for (int cnt = 0; cnt <= s; ++cnt) {
            if (s == 2)
                cerr << "dp[" << cnt << "] = " << dp[pr][cnt][0] + dp[pr][cnt][1] << endl;
            for (int i = 0; i < n + 1; ++i) {
                insum(cdp[i + cnt], (ll)mdp[i] * (dp[pr][cnt][0] + dp[pr][cnt][1]) % M);
            }
        }
        mdp = cdp;
    }

    int ans = 0;
    for (int cnt = 0; cnt <= n; ++cnt) {
        cerr << "mdp[" << cnt << "] = " << mdp[cnt] << endl;
        int cur = (ll)fact[n - cnt] * mdp[cnt] % M;
        if (cnt & 1)
            cur = (M - cur) % M;
        insum(ans, cur);
    }
    cout << ans;
}

Measured memory_bytes: 512