/* be name khoda */

// #define stream_enable
#define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;

#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

const ll MOD = 924844033;
const long long BIG = 1446803456761533460;
const int Big = 336860180;

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()

#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debugp(x) cout << #x << " -> " << "(" << (x).F << ", " << (x).S << ")" << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugap(x, n) cout << #x << " ->\n"; fori (i1_dap, n) { cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
#define debugav(x, n) cout << #x << " ->\n"; fori (i1_dav, n) { fori (i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } cout << '\n'; } cout << endl
#define debugia(x, n) cout << #x << " ->\n"; fori (i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } cout << endl

#define forifrom(i, s, n) for(ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for(ll i = (n) - 1; i >= (e); --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define Add(a, b) a = (a + (b)) % MOD
#define Mul(a, b) a = (a * (b)) % MOD

stringstream sss;

// -----------------------------------------------------------------------

const ll maxn = 2010;

ll N, K;
ll dp[maxn][maxn];
ll fact[maxn];
ll ted[maxn][maxn][4];

void MAIN() {

    fact[0] = 1;
    fori (i, maxn - 1) fact[i + 1] = fact[i] * (i + 1) % MOD;

    cin >> N >> K;

    ted[0][0][2] = 1;
    fori (i, N) {
        fori (j, i + 1) {
            Add(ted[i + 1][j]    [0], ted[i][j][0]);
            Add(ted[i + 1][j + 1][0], ted[i][j][0]);
            Add(ted[i + 1][j + 1][1], ted[i][j][0]);
            Add(ted[i + 1][j]    [2], ted[i][j][1]);
            Add(ted[i + 1][j + 1][2], ted[i][j][1]);
            Add(ted[i + 1][j + 1][3], ted[i][j][1]);
            Add(ted[i + 1][j]    [0], ted[i][j][2]);
            Add(ted[i + 1][j + 1][1], ted[i][j][2]);
            Add(ted[i + 1][j]    [2], ted[i][j][3]);
            Add(ted[i + 1][j + 1][3], ted[i][j][3]);
        }
    }
    dp[0][0] = 1;
    fori (i, K) {
        ll a = (N - 1 - i) / K + 1;
        fori (k, a + 1) {
            ll v = ted[a][k][0] + ted[a][k][2];
            fori (j, N - k + 1) {
                Add(dp[i + 1][j + k], dp[i][j] * v);
            }
        }
    }
    ll ans = 0;
    fori (i, N + 1) {
        ll a = dp[K][i] * fact[N - i] % MOD;
        if (i % 2) {
            Add(ans, MOD - a);
        } else {
            Add(ans, a);
        }
    }
    cout << ans << '\n';

}

// -----------------------------------------------------------------------

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(10);
    sss << R"(
4 2
425 48
    )";
    MAIN();
    return 0;
}


Measured memory_bytes: 156032