Problem: Snuke loves permutations. He is making a permutation of length N.

Since he hates the integer K, his permutation will satisfy the following:

* Let the permutation be a_1, a_2, ..., a_N. For each i = 1,2,...,N, |a_i - i| \neq K.



Among the N! permutations of length N, how many satisfies this condition?

Since the answer may be extremely large, find the answer modulo 924844033(prime).

Constraints

* 2 ≦ N ≦ 2000
* 1 ≦ K ≦ N-1

Input

The input is given from Standard Input in the following format:


N K


Output

Print the answer modulo 924844033.

Examples

Input

3 1


Output

2


Input

4 1


Output

5


Input

4 2


Output

9


Input

4 3


Output

14


Input

425 48


Output

756765083

Solution (in CPP):

Solution:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

typedef long long ll;
const int MOD=924844033;
const int MAXN=2005;

int n,m,ncnt;
int ed[MAXN*2];
ll f[MAXN],d[MAXN*2][MAXN][2],fac[MAXN];
bool vis[MAXN][2];

void Init(){
    fac[0]=1;
    for(int i=1;i<MAXN;i++)
        fac[i]=fac[i-1]*i%MOD;
}

int main(){
    Init();
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        for(int j=0;j<=1;j++){
            if(vis[i][j]) continue;
            for(int x=i,y=j;x<=n;x+=m,y^=1)
                vis[x][y]=1,ncnt++;
            ed[ncnt]=1;
        }
    ed[0]=1;
    d[0][0][0]=1;
    for(int i=0;i<2*n;i++)
        for(int j=0;j<=n;j++){
            d[i+1][j][0]=(d[i][j][0]+d[i][j][1])%MOD;
            if(!ed[i]) d[i+1][j+1][1]=d[i][j][0];
        }
    for(int i=0;i<=n;i++) f[i]=(d[2*n][i][0]+d[2*n][i][1])%MOD;
    ll ans=0;
    for(int i=0,k=1;i<=n;i++,k*=-1)
        ans=(ans+1ll*k*fac[n-i]*f[i]%MOD)%MOD;
    printf("%lld\n",(ans+MOD)%MOD);

    fclose(stdin);
    fclose(stdout);
}