#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e4+7;

const int N_MAX = 302;

int n, k;

int fact[N_MAX];

int dp[N_MAX][N_MAX];

int main()
{
    ifstream fin ("permutari2.in");
    ofstream fout ("permutari2.out");
    fin >> n >> k;
    fact[0] = 1;
    for(int i = 1; i <= n; i++)
        fact[i] = fact[i - 1] * i % MOD;
    dp[0][0] = 1;
    for(int i = 1; i <= n; i++)
    {
        dp[i][1] = fact[i];
        for(int j = 2; j <= i; j++)
        {
            for(int x = 1; x < i; x++)
            {
                dp[i][j] += dp[i - x][j - 1] * dp[x][1] % MOD;
                if(dp[i][j] >= MOD)
                    dp[i][j] -= MOD;
            }
            dp[i][1] -= dp[i][j];
            if(dp[i][1] < 0)
                dp[i][1] += MOD;
        }
    }
    fout << dp[n][k] << "\n";
    return 0;
}