#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair
#define all(o) (o).begin(), (o).end()
#define mset(m,v) memset(m,v,sizeof(m))
#define fr(i,n) for(lli i=0;i<n;++i)
#define rep(i,a,b) for(lli i=a;i<=b;++i)
#define remin(a,b) (a=min((a),(b)))
#define remax(a,b) (a=max((a),(b))) 
#define endl '\n'
typedef long long lli;        typedef long double ld;
typedef pair<lli,lli> ii;     typedef vector<lli> vi;
typedef vector<ii> vii;       typedef vector<vi> graph;
long long MOD=924844033;     long double EPS=1e-9;
#define debarr(a,n) cout<<#a<<" : ";for(int i=0;i<n;i++) cerr<<a[i]<<" "; cerr<<endl;
#define debmat(mat,row,col) cout<<#mat<<" :\n";for(int i=0;i<row;i++) {for(int j=0;j<col;j++) cerr<<mat[i][j]<<" ";cerr<<endl;}
#define pr(...) dbs(#__VA_ARGS__, __VA_ARGS__)
template <class S, class T>ostream& operator <<(ostream& os, const pair<S, T>& p) {return os << "(" << p.first << ", " << p.second << ")";}template <class T>ostream& operator <<(ostream& os, const vector<T>& p) {os << "[ "; for (auto& it : p) os << it << " "; return os << "]";}
template <class T>ostream& operator <<(ostream& os, const unordered_set<T>& p) {os << "[ "; for (auto& it : p) os << it << " "; return os << "]";}template <class S, class T>ostream& operator <<(ostream& os, const unordered_map<S, T>& p) {os << "[ "; for (auto& it : p) os << it << " "; return os << "]";}
template <class T>ostream& operator <<(ostream& os, const set<T>& p) {os << "[ "; for (auto& it : p) os << it << " "; return os << "]";}template <class T>ostream& operator <<(ostream& os, const multiset<T>& p) {os << "[ "; for (auto& it : p) os << it << " "; return os << "]";}
template <class S, class T>ostream& operator <<(ostream& os, const map<S, T>& p) {os << "[ "; for (auto& it : p) os << it << " "; return os << "]";}template <class T> void dbs(string str, T t) {cerr << str << " : " << t << "\n";}
template <class T, class... S> void dbs(string str, T t, S... s) {int idx = str.find(','); cerr << str.substr(0, idx) << " : " << t << ","; dbs(str.substr(idx + 1), s...);}template <class T> void prc(T a, T b) {cerr << "["; for (T i = a; i != b; ++i) {if (i != a) cerr << ", "; cerr << *i;} cerr << "]\n";}
lli binpow(lli b,lli p,lli mod){lli ans=1;for(;p;p>>=1){if(p&1)ans=ans*b%mod;b=b*b%mod;}return ans;}

lli f[2010][1010];
lli fact[2010];
void pre(){
	fact[0]=1;
	rep(i,1,2000){
		fact[i]=fact[i-1]*i%MOD;
	}
	f[0][0]=1;
	for(int i=0;i<2010;i++){
		for(int j=0;j<1010;j++){
			if(j==0){
				f[i][j]=1;
			}else if(i<2*j-1){
				f[i][j]=0;
			}else if(i==1&&j==1){
				f[i][j]=1;
			}else{
				f[i][j]=(f[i-2][j-1]+f[i-1][j])%MOD;
			}
		}
	}
}

void solve(){
	lli n,k;
	cin>>n>>k;
	vi path;
	for(int i=1;i<=k;i++){
		path.EB((n-i)/k);
		path.EB((n-i)/k);
	}
	lli ans[2020];
	mset(ans,0);
	ans[0]=1;
	for(int i=0;i<path.size();i++){
		for(lli k=2000;k>=1;k--){
			for(int j=min((path[i]+1)/2,k);j>=1;j--){
				ans[k]=(ans[k]+ans[k-j]*f[path[i]][j])%MOD;
			}
		}
	}
	lli final=0;
	rep(i,0,n){
		if(i%2)final=((final-fact[n-i]*ans[i])%MOD+MOD)%MOD;
		else final=(final+fact[n-i]*ans[i])%MOD;
	}
	cout<<final<<endl;
}	

signed main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);
	pre();int t=1;//cin>>t;
	for(int i=1;i<=t;i++){
		//cout<<"Case #"<<i<<": ";
		solve();
	}
}

Measured memory_bytes: 16256