#include <bits/stdc++.h>
using namespace std;
const long long MOD=924844033;

template<uint_fast64_t Modulus> class modint{
    using u64=uint_fast64_t;
    public:
    u64 a;
    constexpr modint(const u64 x=0) noexcept:a(((x%Modulus)+Modulus)%Modulus){}
    constexpr u64 &value() noexcept{return a;}
    constexpr const u64 &value() const noexcept{return a;}
    constexpr modint &operator+=(const modint &rhs) noexcept{
        a+=rhs.a;
        if (a>=Modulus) a-=Modulus;
        return *this;
    }
    constexpr modint operator+(const modint &rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint &operator++() noexcept{
        return ++a,*this;
    }
    constexpr modint operator++(int) noexcept{
        modint t=*this; return ++a,t;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept{
        if (a<rhs.a) a+=Modulus;
        a-=rhs.a;
        return *this;
    }
    constexpr modint operator-(const modint &rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint &operator--() noexcept{
        return --a,*this;
    }
    constexpr modint operator--(int) noexcept{
        modint t=*this; return --a,t;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept{
        a=a*rhs.a%Modulus;
        return *this;
    }
    constexpr modint operator*(const modint &rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        u64 exp=Modulus-2;
        while(exp){
            if (exp&1) *this*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return *this;
    }
    constexpr modint operator/(const modint &rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint operator-() const noexcept{
        return modint(Modulus-a);
    }
    constexpr bool operator==(const modint &rhs) const noexcept{
        return a==rhs.a;
    }
    constexpr bool operator!=(const modint &rhs) const noexcept{
        return a!=rhs.a;
    }
    constexpr bool operator!() const noexcept{return !a;}
    friend constexpr modint pow(modint rhs,long long exp) noexcept{
        modint res{1};
        while(exp){
            if (exp&1) res*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return res;
    }
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept{
        return modint(x)+y;
    }
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept{
        return modint(x)-y;
    }
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept{
        return modint(x)*y;
    }
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept{
        return modint(x)/y;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept {
        return s << rhs.a;
    }
    friend istream &operator>>(istream &s,modint &rhs) noexcept {
        u64 a; rhs=modint{(s >> a,a)}; return s;
    }
};

using mint=modint<MOD>;

const int MAX_N=2010;

int N,K,used=1; mint ans=0;
vector<int> cnt(MAX_N);
vector<mint> fac(MAX_N,1);
mint dp[MAX_N][MAX_N][2];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> K;
    for (int i=0;i<N;++i){
        if (i==0||(i&&N<cnt[i-1]+2*K)) cnt[i]=used++;
        else cnt[i]=cnt[i-1]+2*K;
    }
    dp[0][0][0]=1;
    for (int i=0;i<N;++i){
        for (int j=0;j<N+1;++j){
            dp[i+1][j][0]+=dp[i][j][0]+dp[i][j][1];
            if (cnt[i]+K<=N) dp[i+1][j+1][1]+=dp[i][j][0]+dp[i][j][1];
            if (1<=cnt[i]-K) dp[i+1][j+1][0]+=dp[i][j][0];
            if (cnt[i+1]!=cnt[i]+2*K){
                dp[i+1][j][0]+=dp[i+1][j][1];
                dp[i+1][j][1]=0;
            }
        }
    }
    for (int i=0;i<N;++i) fac[i+1]=fac[i]*(i+1);
    for (int j=0;j<N+1;++j){
        if (j&1) ans-=(dp[N][j][0]+dp[N][j][1])*fac[N-j];
        else ans+=(dp[N][j][0]+dp[N][j][1])*fac[N-j];
    }
    cout << ans << '\n';
}

Measured memory_bytes: 63104