// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 2e3 + 5;
const int MOD = 924844033;

int N, K;

void input()
{
    read(N); read(K);
}

void solve()
{
    static int fac[MAXN];

    fac[0] = 1;
    for (int i = 1; i <= N; ++i) {
        fac[i] = (LL)fac[i - 1] * i % MOD;
    }

    static int f[MAXN][MAXN][2][2];
    int rng = (N + K * 2 - 1) / (K * 2);

    f[1][0][0][0] = f[1][1][0][1] = 1;
    f[1][0][1][0] = f[1][1][1][0] = f[1][1][1][1] = 1;
    for (int i = 1; i < rng; ++i) {
        for (int j = 0; j <= i; ++j) {
            for (int k = 0; k <= 1; ++k) {
                (f[i + 1][j][k][0] += f[i][j][k][0]) %= MOD;
                (f[i + 1][j + 1][k][0] += f[i][j][k][0]) %= MOD;
                (f[i + 1][j + 1][k][1] += f[i][j][k][0]) %= MOD;
                (f[i + 1][j][k][0] += f[i][j][k][1]) %= MOD;
                (f[i + 1][j + 1][k][1] += f[i][j][k][1]) %= MOD;
            }
        }
    }

    static int g[MAXN];

    g[0] = 1;
    for (int i = 1; i <= K * 2 && i <= N; ++i) {
        int t = (N - i + 1 + K * 2 - 1) / (K * 2);
        int fr = (i - K >= 1), ed = (i + (t - 1) * K * 2 + K <= N);
        for (int j = N; j >= 0; --j) {
            for (int k = 1; k <= t && j + k <= N; ++k) {
                (g[j + k] += (LL)g[j] * f[t][k][fr][0] % MOD) %= MOD;
                if (ed) (g[j + k] += (LL)g[j] * f[t][k][fr][1] % MOD) %= MOD;
            }
        }
    }

    int ans = 0;
    for (int i = 0; i <= N; ++i) {
        (ans += (LL)(i & 1 ? MOD - 1 : 1) * fac[N - i] % MOD * g[i] % MOD) %= MOD;
    }

    printf("%d\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("D.in", "r", stdin);
    freopen("D.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 射人先射马，擒贼先擒王。
//     -- 杜甫《前出塞九首·其六》


Measured memory_bytes: 31232