#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari2.in");
ofstream out("permutari2.out");
const int mod = 10007;
const int maxn = 305;
int dp[maxn][maxn];
int fact[maxn];
int main()
{
    int n, k;
    in >> n >> k;
    dp[1][1] = 1;
    int fact = 1;
    for(int i = 2; i <= n; i++)
    {
        fact = fact * i % mod;
        for(int j = 2; j <= i; j++)
            for(int p = j - 1; p < i; p++)
                dp[i][j] = (dp[i][j] + dp[p][j - 1] * dp[i - p][1]) % mod;
        dp[i][1] = fact;
        for(int j = i; j >= 2; j--)
        {
            dp[i][1] = dp[i][1] - dp[i][j];
            if(dp[i][1] < 0)
                dp[i][1] = dp[i][1] + mod;
        }
    }
    out << dp[n][k] << "\n";
    return 0;
}