#include <cstdio>

using namespace std;

const int Mod=10007;

int N,K,i,k,j;
long long d[305][305];

int main()
{
    freopen("permutari2.in", "r", stdin);
    freopen("permutari2.out", "w", stdout);

    scanf("%d%d", &N, &K);

    d[1][1]=d[1][0]=1;
    for(i=2; i<=N; ++i)
    {
        d[i][1]=d[i][0]=d[i-1][0]*i%Mod;

        for(j=2; j<=i; ++j)
        {
            for(k=j-1; k<i; ++k)
                d[i][j] += d[k][j-1]*d[i-k][1];

            d[i][j]%=Mod;
            d[i][1]-=d[i][j];
        }
        while(d[i][1]<0LL) d[i][1]+=Mod;
    }

    printf("%lld\n", d[N][K]);

    return 0;
}