#include <bits/stdc++.h>
#define mod 10007

using namespace std;

ifstream fin("permutari2.in");
ofstream fout("permutari2.out");

int n, k;
int dp[302][302];

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