#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 924844033;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

ll fac[MAX_N], inv[MAX_N], fiv[MAX_N]; //fiv:inv(fac(i))

ll mod_pow(ll a, ll n) {
	if(n == 0) return 1;
	ll res = mod_pow(a, n / 2);
	if(n % 2 == 0) return res * res % mod;
	else return a * res % mod * res % mod;
}

ll invf(ll a) {
	return mod_pow(a, mod - 2);
}

void C_init(int n) {
	fac[0] = fac[1] = 1; inv[1] = 1;
	fiv[0] = fiv[1] = 1;
	rep(i, 2, n + 1) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		fiv[i] = fiv[i - 1] * inv[i] % mod;
	}
}

ll C(int a, int b) { //assume a >= b
	if(a < b || a < 0 || b < 0) return 0;
	return fac[a] * fiv[b] % mod * fiv[a - b] % mod;
}

int N, K;
vector<int> vec;
vector<int> G[MAX_N];
bool used[MAX_N];
ll dp[2][2010];

int loop(int v) { 
	int res = 1;
	used[v] = true;
	rep(i, 0, sz(G[v])) {
		int n = G[v][i];
		if(!used[n]) res += loop(n);
	}
	return res;
}

ll get_pre(int n, int b) {
	return C(n - b + 1, b);
}

void solve() {
	cin >> N >> K;
	C_init(N + 10);
	rep(i, 0, N) {
		if(i - K >= 0) {
			G[i].pb(i - K + N);
			G[i - K + N].pb(i);
		}
		if(i + K < N) {
			G[i].pb(i + K + N);
			G[i + K + N].pb(i);
		}
	}
	rep(i, 0, N) {
		if(!used[i]) {
			int v = loop(i);
			if(v - 1) vec.pb(v - 1);
		}
	}
	// debug(vec);
	int now = 0, to = 1;
	dp[0][0] = 1;

	rep(q, 0, sz(vec)) {
		memset(dp[to], 0, sizeof(dp[to]));
		rep(i, 0, N + 1) {
			if(!dp[now][i]) continue;
			rep(k, 0, vec[q] + 1) {
				if(i + k <= N)ADD(dp[to][i + k], dp[now][i] * get_pre(vec[q], k) % mod);
			}
		}
		swap(now, to);
	}
	ll res = 0;
	rep(i, 0, N + 1) {
		// debug(i, dp[now][i]);
		if(i % 2 == 0) ADD(res, (dp[now][i] * fac[N - i]) % mod);
		else ADD(res, mod - (dp[now][i] * fac[N - i]) % mod);
	}
	cout << res << "\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 8448