#include <iostream>
#include <cstdio>
#define MAXN 350
#define MOD 10007

using namespace std;

int n, k, din[MAXN][MAXN], fact[MAXN];

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

    scanf("%d %d", &n, &k);
    fact[0] = 1;
    din[1][1] = 1;
    for (int i = 1; i < MAXN; i++)
        fact[i] = (i * fact[i-1]) % MOD;
    for (int i = 2; i <= n; i++) {
        for (int j = 2; j <= i; j++)
            for (int k = j-1; k < i; k++)
                din[i][j] = (din[i][j] + din[k][j-1]*din[i-k][1]) % MOD;
        din[i][1] = fact[i];
        for (int j = 2; j <= i; j++)
            din[i][1] = (MOD + din[i][1] - din[i][j]) % MOD;
    }
    printf("%d", din[n][k]);


    return 0;
}