#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari2.in");
ofstream out("permutari2.out");
const int mod = 10007;
const int maxn = 305;
int dp[maxn][maxn];
int fact[maxn];
int main()
{
    int n, k;
    in >> n >> k;
    fact[0] = 1;
    for(int i = 1; i < maxn; i++)
        fact[i] = (1LL * fact[i - 1] * i) % mod;
    dp[1][1] = 1;
    for(int i = 2; i <= n; i++)
    {
        for(int j = 1; j < n; j++)
            dp[1][i] = (dp[1][i] + fact[j] * dp[1][i - j]) % mod;
        dp[1][i] = (fact[i] - dp[1][i]) % mod;
    }
    for(int i = 2; i <= k; i++)
        for(int j = i; j <= n; j++)
            for(int p = 1; p <= j; p++)
                dp[i][j] = (dp[i][j] + dp[1][p] * dp[i - 1][j - p]) % mod;
    out << dp[k][n] << "\n";
    return 0;
}