#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxN 301
#define mod 10007
using namespace std;
int n, i, j, k, dp[maxN][maxN], f[maxN];
int main()
{
    freopen("permutari2.in", "r", stdin);
    freopen("permutari2.out", "w", stdout);
    scanf("%d %d", &n, &k);
    int l;
    f[1] = 1;
    dp[1][1] = 1;

    for (i = 2; i <= n; ++ i)
    {
        f[i] = (f[i - 1] * i) % mod;
        dp[i][1] = f[i];
        for (j = 2; j <= i; ++ j)
        {
            for (l = j - 1; l < i; ++ l)
                dp[i][j] = (dp[i][j] + (dp[l][j - 1] * dp[i - l][1]) % mod) % mod;

            dp[i][1] -= dp[i][j];
            if (dp[i][1] < 0)
                dp[i][1] += mod;
        }
    }
    printf("%d", dp[n][k]);
    return 0;
}