#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 924844033;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
int main() {
	ll N, K;
	cin >> N >> K;

	vll a(N + 1, 1);//制約を受けるか
	ll x = N / K;

	ll c = 1;
	repn(i, N % K) { a[c] = 0; c += x + 1; }
	repn(i, K - N % K) { a[c] = 0; c += x; }

	vvvmint dp(N + 1, vvmint(N + 1, vmint(3, 0)));
	dp[0][0][0] = 1;

	repn(i, N)rep(j, N + 1) {
		ll x = i - j;
		ll y = i - j - 1;

		if (a[i] == 0) {
			dp[i][j][0] += dp[i - 1][j][0] + dp[i - 1][j][1] + dp[i - 1][j][2];

			if (j > 0)dp[i][j][1] += (dp[i - 1][j - 1][0] + dp[i - 1][j - 1][1] + dp[i - 1][j - 1][2]) * x * 2;

			if (j > 1)dp[i][j][2] += (dp[i - 1][j - 2][0] + dp[i - 1][j - 2][1] + dp[i - 1][j - 2][2]) * (x + 1) * (x + 1);

			if (j > 0)dp[i][j][2] += dp[i - 1][j - 1][0] + dp[i - 1][j - 1][1] + dp[i - 1][j - 1][2];
		}

		else {
			dp[i][j][0] += dp[i - 1][j][0] + dp[i - 1][j][1] + dp[i - 1][j][2];

			if (j > 0)dp[i][j][1] += dp[i - 1][j - 1][0] * (2 * x - 2) + dp[i - 1][j - 1][1] * (2 * x - 1) + dp[i - 1][j - 1][2] * x * 2;

			if (j > 1)dp[i][j][2] += dp[i - 1][j - 2][0] * x * x + dp[i - 1][j - 2][1] * x * (x + 1) + dp[i - 1][j - 2][2] * (x + 1) * (x + 1);

			if (j > 0)dp[i][j][2] += dp[i - 1][j - 1][0] + dp[i - 1][j - 1][1] + dp[i - 1][j - 1][2];
		}

		//rep(k, 3) cout << i << " " << j << " " << k << " " << dp[i][j][k] << endl;
	}

	cout << dp[N][N][2] << endl;

}

Measured memory_bytes: 219392