#include <iostream>
#include <cstdio>

using namespace std;
const int MOD = 10007;
int main()
{
    freopen("permutari2.in","r",stdin);
    freopen("permutari2.out","w",stdout);
    cin.sync_with_stdio(false);
    int dp[303][303], fact[303];
    fact[0] = 1;
    int n, k;
    cin >> n >> k;
    for(int i=1;i<=n;++i)
        fact[i] = fact[i-1]*i%MOD;
    dp[1][1] = 1;
    for(int i=2;i<=n;++i){
        int x = fact[i];
        for(int j=2;j <= i;++j){
            for(int p = j-1;p < i; ++p){
                dp[i][j] += dp[p][j-1]*dp[i-p][1]%MOD;
                if(dp[i][j] >= MOD)
                    dp[i][j] -= MOD;
            }
            x -= dp[i][j];
            if(x < 0)
                x += MOD;
        }
        dp[i][1] = x;
    }
    cout<<dp[n][k]<<"\n";
    return 0;
}