#include <bits/stdc++.h>

using namespace std;
ifstream fin("permutari2.in");
ofstream fout("permutari2.out");
const int nmax = 305;
const int mod = 10007;
int n,K,dp[nmax][nmax],f[nmax];

inline void Solve()
{
    fin >> n >> K;
    f[1] = 1;
    for(int i = 2; i <= n; i++) f[i] = (f[i-1]*i)%mod;
    dp[1][1] = dp[2][1] = dp[2][2] = 1;
    for(int i = 3; i <= n; i++)
    {
        dp[i][1] = f[i];
        for(int j = 2; j <= i; j++)
        {
            for(int k = 1; k < i; k++)
                dp[i][j] += (dp[k][j-1] * dp[i-k][1]);
            dp[i][j] %= mod;
            dp[i][1] -= dp[i][j];
            if(dp[i][1] < 0) dp[i][1] +=mod;
        }
    }
    fout << dp[n][K] << "\n";
}
int main()
{
    Solve();
    return 0;
}