#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 924844033;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair

const int MAXN = 3010;

vl fact(MAXN);
vl rfact(MAXN);

ll mod_pow(ll x, ll p, ll M = MOD) {
  ll a = 1;
  while (p) {
    if (p % 2)
      a = a*x%M;
    x = x*x%M;
    p /= 2;
  }
  return a;
}

ll mod_inverse(ll a, ll M = MOD) {
  return mod_pow(a, M - 2, M);
}

void set_fact(ll n, ll M = MOD) {
  fact[0] = fact[1] = rfact[0] = rfact[1] = 1;
  for (ll i = 2; i <= n; i++) {
    fact[i] = i * fact[i - 1] % M;
    rfact[i] = mod_inverse(fact[i], M);
  }
}


int main() {
  int n, k;
  cin >> n >> k;

  set_fact(n + 5);
  
  vll dps(2 * k);
  rep (s, 2 * k) {
    if (s >= n) {
      dps[s] = {1};
      continue;
    }
    int m = 1 + (n - 1 - s) / (2 * k);
    vector<vll> dp(m + 1, vll(m + 1, vl(2)));

    if (s >= k) dp[0][0][1] = 1;
    else dp[0][0][0] = 1;

    rep (i, m) {
      int u = s + i * 2 * k;
      rep (j, m + 1) {
        rep (kk, 2) {
          if (dp[i][j][kk] == 0) continue;
          (dp[i + 1][j][1] += dp[i][j][kk]) %= MOD;
          if (u + k < n) {
            (dp[i + 1][j + 1][0] += dp[i][j][kk]) %= MOD;
          }
          if (kk == 1) {
            (dp[i + 1][j + 1][1] += dp[i][j][kk]) %= MOD;
          }
        }
      }
    }

    /*
    rep (i, m + 1) {
      rep (j, m + 1) {
        cout << pll(dp[i][j][0], dp[i][j][1]) << " ";
      }
      cout << endl;
    }
    cout << endl;
    //*/

    rep (i, m + 1) {
      dps[s].push_back((dp[m][i][0] + dp[m][i][1]) % MOD);
    }
  }

  //DEBUG_MAT(dps);

  vll dp2(2*k + 1, vl(n + 1));
  dp2[0][0] = 1;
  rep (i, 2 * k) {
    rep (j, n + 1) {
      if (dp2[i][j] == 0) continue;
      rep (kk, dps[i].size()) {
        if (dps[i][kk] == 0) continue;
        (dp2[i + 1][j + kk] += dp2[i][j] * dps[i][kk] % MOD) %= MOD;
      }
    }
  }

  rep (i, n + 1) {
    dp2[2*k][i] = dp2[2*k][i] * fact[n - i] % MOD;
  }
  
  ll ans = 0;
  rep (i, n + 1) {
    if (i % 2 == 0) {
      ans += dp2[2*k][i];
    }
    else {
      ans -= dp2[2*k][i];
    }
    ans %= MOD;
  }
  cout << (ans + MOD) % MOD << endl;
}


Measured memory_bytes: 63232