#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream cin("permutari2.in");
ofstream cout("permutari2.out");

const int MAXN = 300;
const int MOD = 10007;

int dp[1 + MAXN][1 + MAXN];
int factorial[1 + MAXN];

int main() {
    int n, k;
    cin >> n >> k;
    factorial[0] = 1;
    for (int i = 1; i <= n; i++)
        factorial[i] = (i * factorial[i - 1]) % MOD;
    dp[1][1] = dp[2][1] = dp[2][2] = 1;
    for (int i = 3; i <= n; i++) {
        dp[i][1] = factorial[i];
        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;
        }
    }
    cout << dp[n][k] << "\n";
    return 0;
}