// {{{ by shik
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define FOR(it,c) for ( auto it=(c).begin(); it!=(c).end(); it++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

#ifdef SHIK
template<typename T>
void _dump( const char* s, T&& head ) { cerr<<s<<"="<<head<<endl; }

template<typename T, typename... Args>
void _dump( const char* s, T&& head, Args&&... tail ) {
    int c=0;
    while ( *s!=',' || c!=0 ) {
        if ( *s=='(' || *s=='[' || *s=='{' ) c++;
        if ( *s==')' || *s==']' || *s=='}' ) c--;
        cerr<<*s++;
    }
    cerr<<"="<<head<<", ";
    _dump(s+1,tail...);
}

#define dump(...) do { \
    fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); \
    _dump(#__VA_ARGS__, __VA_ARGS__); \
} while (0)

template<typename Iter>
ostream& _out( ostream &s, Iter b, Iter e ) {
    s<<"[";
    for ( auto it=b; it!=e; it++ ) s<<(it==b?"":" ")<<*it;
    s<<"]";
    return s;
}

template<typename A, typename B>
ostream& operator <<( ostream &s, const pair<A,B> &p ) { return s<<"("<<p.first<<","<<p.second<<")"; }
template<typename T>
ostream& operator <<( ostream &s, const vector<T> &c ) { return _out(s,ALL(c)); }
template<typename T, size_t N>
ostream& operator <<( ostream &s, const array<T,N> &c ) { return _out(s,ALL(c)); }
template<typename T>
ostream& operator <<( ostream &s, const set<T> &c ) { return _out(s,ALL(c)); }
template<typename A, typename B>
ostream& operator <<( ostream &s, const map<A,B> &c ) { return _out(s,ALL(c)); }
#else
#define dump(...)
#endif

template<typename T>
void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( long long &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }

void R() {}
template<typename T, typename... U>
void R( T& head, U&... tail ) {
    _R(head);
    R(tail...);
}

template<typename T>
void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
template<typename T>
void _W( const vector<T> &x ) {
    for ( auto i=x.cbegin(); i!=x.cend(); i++ ) {
        if ( i!=x.cbegin() ) putchar(' ');
        _W(*i);
    }
}

void W() {}
template<typename T, typename... U>
void W( const T& head, const U&... tail ) {
    _W(head);
    putchar(sizeof...(tail)?' ':'\n');
    W(tail...);
}

#ifdef SHIK
#define FILEIO(...)
#else
#define FILEIO(name) do {\
    freopen(name ".in","r",stdin); \
    freopen(name ".out","w",stdout); \
} while (0)
#endif

// }}}

const int N=2010;
const LL MOD=924844033;

int n,k;
bool cut[N];
LL _dp[2][N][2][2];
auto dp=_dp[0],ndp=_dp[1];

int main() {
    R(n,k);

    int z=0;
    REP(i,k) {
        z+=n/k;
        if ( i<n%k ) z++;
        cut[z]=1;
    }

    // i+x == j+y
    dp[0][0][0]=1;
    REP(t,n) {
        if ( cut[t] ) {
            memset(ndp,0,sizeof(_dp[0]));
            REP(i,t+1) REP(x,2) REP(y,2) {
                int j=i+x-y;
                if ( j<0 ) continue;
                ndp[i+x][0][0]+=dp[i][x][y];
            }
            swap(dp,ndp);
        }
        memset(ndp,0,sizeof(_dp[0]));
        REP(i,t+1) REP(x,2) REP(y,2) {
            int j=i+x-y;
            if ( j<0 ) continue;
            LL me=dp[i][x][y]%MOD;
            if ( me==0 ) continue;
            // dump(t,i,j,x,y,me);
            ndp[i+x][0][0]+=me;
            ndp[i+x][1][1]+=me;
            if ( i>0 ) ndp[i+x-1][1][0]+=me*i%MOD;
            if ( j>0 ) ndp[i+x][0][1]+=me*j%MOD;
            if ( i>0 && j>0 ) ndp[i+x-1][0][0]+=me*i%MOD*j%MOD;
        }
        swap(dp,ndp);
    }
    W(dp[0][0][0]%MOD);
    return 0;
}


Measured memory_bytes: 384