#include <bits/stdc++.h>
#define N 305
#define MOD 10007


using namespace std;

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

int dp[N][N] , fact[N] ;

int main()
{
    int n , k , i , j , p ;
    fin >> n >> k ;
    dp[1][1] = 1 ;
    fact[1] = 1 ;
    for ( i = 2 ; i <= n ; i++ )
        fact[i] = ( fact[i-1]*i ) % MOD;
    for ( i = 2 ; i <= n ; i++ )
    {
        dp[i][1] = fact[i] ;
        for ( j = 1 ; j < i ; j++ )
        {
            dp[i][1] =  dp[i][1] - ( fact[j] * dp[i-j][1] ) % MOD;
            dp[i][1] = (dp[i][1]+MOD)%MOD ;
        }
    }
    for ( i = 2 ; i <= n ; i++ )
    {
        for ( j = 1 ; j < i ; j++ )
        {
            for ( p = 2 ; p <= min(i,k) ; p++ )
            {
                dp[i][p] = ( dp[i][p] + dp[j][p-1]*dp[i-j][1] ) % MOD ;
            }
        }
    }
    fout << dp[n][k] ;
}