#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=924844033;

class comb{
public:
    ll mod;
    ll mx;
    vector<ll> F;
    vector<ll> FR;
    

    comb(ll mod=1000000007,ll mx=100000):mod(mod),mx(mx),F(mx+1,1){
        mk_F();
    }
    
    ll mod_pow(ll a,ll x){
        a%=mod;
        ll ans=1;
        while(x>0){
            if(x&1){ans*=a; ans%=mod;}
            a*=a;
            a%=mod;
            x>>=1;
        }
        return ans;
    }
    
    pll Ex_gcd(ll a,ll b){
        if(b==0){return {1,0};}
        pll ret=Ex_gcd(b,a%b);
        ret.F-=a/b*ret.S;
        return {ret.S,ret.F};
    }
    
    ll prime_R(ll a){
        return mod_pow(a,mod-2);
    }
    
    ll R(ll a){
        ll ret=Ex_gcd(a,mod).F;
        ret%=mod;
        if(ret<0){ret+=mod;}
        return ret;
    }
    
    void mk_F(){
        for(ll i=1;i<=mx;i++){F[i]=F[i-1]*i%mod;}
    }
    
    ll c(ll n,ll k){
        if(n<k){return 0;}
        if(n==k || k==0){return 1;}
        return F[n]*FR[n-k]%mod*FR[k]%mod;
    }
    
    //mod must be prime
    ll Lucas_C(ll n,ll m){
        ll ret=1;
        while(n>0 || m>0){
            ret*=c(n%mod,m%mod);
            ret%=mod;
            n/=mod; m/=mod;
        }
        return ret;
    }
    
    ll Stirling(ll n,ll k){
        ll ret=0;
        for(ll i=1;i<=k;i++){
            if((k-i)%2){ret-=c(k,i)*mod_pow(i,n)%mod;}
            else{ret+=c(k,i)*mod_pow(i,n)%mod;}
            ret%=mod;
        }
        ret*=R(F[k]);
        ret%=mod;
        if(ret<0){ret+=mod;}
        return ret;
    }
    
    ll Bell(ll n,ll k){
        ll ret=0;
        for(ll i=1;i<=k;i++){ret+=Stirling(n,i); ret%=mod;}
        return ret;
    }
};



int main(){
    comb C(MOD,100000);
    ll n,k;
    cin>>n>>k;
    vector<vector<vector<int>>> dp(n,vector<vector<int>>(n+1,vector<int>(2,0)));
    dp[0][0][0]=1;
    dp[0][1][1]=1;
    for(int i=0;i+1<n;i++){
        for(int t=0;t<n;t++){
            dp[i+1][t][0]+=(dp[i][t][0]+dp[i][t][1])%MOD;
            dp[i+1][t+1][1]+=(dp[i][t][0]+dp[i][t][1])%MOD;
            dp[i+1][t+1][0]+=dp[i][t][0];
            dp[i+1][t+1][0]%=MOD;
            dp[i+1][t+1][1]%=MOD;
            dp[i+1][t][0]%=MOD;
        }
    }
    /*
    for(int i=0;i<n;i++){
        for(int t=0;t<=n;t++){
            cout<<dp[i][t][0]<<" ";
        }
        cout<<endl;
    }
    cout<<endl;
     */
    ll K=k;
    k*=2;
    vector<vector<int>> dp2(k+1,vector<int>(n+1,0));
    ll size=0;
    dp2[0][0]=1;
    for(int i=0;i<k;i++){
        ll a=(n-i%K+K-1)/K;
        ll b=(a+1)/2;
        //cout<<i<<" "<<a<<" "<<b<<endl;
        if(a==0){dp2[i+1]=dp2[i]; continue;}
        ll mx=0;
        for(int t=0;t<=size;t++){
            for(int h=0;h<=b;h++){
                if(a&1){
                    dp2[i+1][t+h]+=(ll)dp2[i][t]*dp[b-1][h][0]%MOD;
                    dp2[i+1][t+h]%=MOD;
                }
                else{
                    dp2[i+1][t+h]+=(ll)dp2[i][t]*((ll)dp[b-1][h][0]+dp[b-1][h][1])%MOD;
                    dp2[i+1][t+h]%=MOD;
                }
                if(dp2[i+1][t+h]!=0){mx=max(mx,(ll)t+h);}
            }
        }
        size=mx;
    }
    /*
    for(int i=0;i<=k;i++){
        for(int t=0;t<=n;t++){
            cout<<dp2[i][t]<<" ";
        }
        cout<<endl;
    }
     */
    ll ans=0;
    for(int i=0;i<=n;i++){
        if(i&1){ans-=(ll)dp2[k][i]*C.F[n-i]%MOD;}
        else{ans+=(ll)dp2[k][i]*C.F[n-i]%MOD;}
    }
    ans%=MOD;
    if(ans<0){ans+=MOD;}
    cout<<ans<<endl;
    
    
    return 0;
}


Measured memory_bytes: 251392