const int LG = 21;
const int FN = 400005;
const long long MOD = 924844033;
const long long INF = 1e9;
const long long INFLL = 1e18;

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <time.h>
#include <unordered_set>
#include <bitset>
#include <deque>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};

ll inq(ll x, ll y)
{
    if (!y) re 1 % MOD;
    ll l = inq(x, y / 2);
    if (y % 2) re l * l % MOD * x % MOD;
    re l * l % MOD;
}

ll rev(ll x)
{
    return inq(x, MOD - 2);
}

bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;

void __precompute_combinatorics()
{
    __precomputed_combinatorics = 1;
    __fact.resize(FN);
    __ufact.resize(FN);
    __rev.resize(FN);
    __rev[1] = 1;
    for (int i = 2; i < FN; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
    __fact[0] = 1, __ufact[0] = 1;
    for (int i = 1; i < FN; i++) __fact[i] = __fact[i - 1] * i % MOD, __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}

ll fact(int x)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[x];
}

ll cnk(int n, int k)
{
    if (!__precomputed_combinatorics) __precompute_combinatorics();
    return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}

const int N = 2020;
int n, k;

long long dp[2 * N];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> k;
    dp[0] = 1;
    vector<vector<ll> > ways(n + 1, vector<ll>(n + 1));
    ways[0][0] = 1;
    for (int zu = 1; zu <= n; zu++)
    {
        for (int have_took = 0; have_took < n; have_took++)
        {
            if (zu >= 2) ways[zu][have_took + 1] = (ways[zu][have_took + 1] + ways[zu - 2][have_took]) % MOD;
            ways[zu][have_took] = (ways[zu][have_took] + ways[zu - 1][have_took]) % MOD;
        }
    }
    dbg(n);
    for (int i = 0; i < 2 * k; i++)
    {
        int cnt = 0;
        int j = i % k;
        while (j < n)
        {
            cnt++;
            j += k;
        }

        //cout << ways[cnt][cnt / 2] << "\n";
        //cout << cnt << "\n";
        for (int have = n; have >= 0; have--)
        {
            for (int take = 1; 2 * take <= cnt; take++)
            {
                dp[have + take] = (dp[have + take] + dp[have] * ways[cnt][take]) % MOD;
            }
        }
    }
    //cout << dp[0] << " " << dp[1] << " " << dp[2] << "\n";
    ll ans = 0;
    for (int k = 0; k <= n; k++)
    {
        if (k % 2 == 0)
            ans = (ans + dp[k] * fact(n - k)) % MOD;
        else
            ans = (ans + MOD * MOD - dp[k] * fact(n - k)) % MOD;
    }
    cout << ans;
}

/* Note:
Check constants at the beginning of the code.
    N is set to 4e5 but be careful in problems with large constant factor.
    Setting N in every problem is more effective.
Check corner cases.
    N = 1
No def int long long for now.
Add something here.
*/


Measured memory_bytes: 41088