#include <bits/stdc++.h>
#define mod 10007
using namespace std;

int fact[310];
int q[310]; /// in cate moduri am o secv de lungime i si un sg
int dp[310][310]; /// lungime i, j prefixe

int main()
{
    ifstream in("permutari2.in");
    ofstream out("permutari2.out");

    int n, k;
    in >> n >> k;

    fact[0] = 1;
    for (int i = 1; i <= n; i++)
        fact[i] = i * fact[i - 1] % mod;

    for (int i = 1; i <= n; i++) {
        q[i] = fact[i];
        for (int j = i - 1; j >= 1; j--)
            q[i] = (q[i] - q[j] * fact[i - j]) % mod;
        q[i] = (q[i] + mod) % mod;
        dp[i][1] = q[i];
    }

    for (int i = 1; i <= n; i++)
        for (int j = 2; j <= min(i, k); j++)
            for (int k = 1; k < i; k++)
                dp[i][j] = (dp[i][j] + dp[i - k][j - 1] * dp[k][1]) % mod;

    out << dp[n][k] << '\n';

    return 0;
}