#include <cstdio>
#include <cstring>

FILE *fin=fopen("permutari2.in","r");
FILE *fout=fopen("permutari2.out","w");

int n,k;

//#define BACK
#define MODNR 10007

#ifndef BACK
int c[301][301];
long long fact[301];
#else

int st[301];
bool bif[301];
int count=0;

void back(int kk)
{
    if (kk==n+1)
    {
        int nr=0;
        for (int i=1; i<=n; i++)
        {
            bool ok=true;
            for (int j=1; j<=i; j++)
                if (st[j]>i)
                {
                    ok=false;
                    break;
                }
            if (ok)
                nr++;
        }
        if (nr==k)
        {
            count++;
            count%=MODNR;
        }
        return;
    }
	
    for (int i=1; i<=n; i++)
        if (!bif[i])
        {
            bif[i]=1;
            st[kk]=i;
            back(kk+1);
            bif[i]=0;
        }
}

#endif


int main()
{
    fscanf(fin,"%d %d",&n,&k);
#ifndef BACK
    fact[0]=1;
    for (int i=1; i<=n; i++)
        fact[i]=(fact[i-1]*i)%MODNR;
	
	for (int j=1; j<=n; j++)
	{
		int tmp=0;
		for (int i=2; i<=k; i++)
        {
            c[j][i]=0;
            for (int k=1; k<j; k++)
            {
                c[j][i]=(c[j][i]+c[k][i-1]*c[j-k][1])%MODNR;
            }
			tmp+=c[j][i];
			tmp%=MODNR;
        }
		c[j][1]=(fact[j]-tmp+MODNR)%MODNR;
	}
    fprintf(fout,"%d\n",c[n][k]);
#else
    memset(bif,0,sizeof(bool)*n);
    back(1);
    fprintf(fout,"%d\n",count);
#endif
    fclose(fin);
    fclose(fout);
    return 0;
}