#include<fstream>
#define mod 10007
using namespace std;
int n, k, i, j, ii, sum;
int d[305][305], f[305];
ifstream fin("permutari2.in");
ofstream fout("permutari2.out");
int main(){
    fin>> n >> k;
    d[1][1] = 1;
    f[1] = 1;
    for(i = 2; i <= n; i++){
        f[i] = f[i - 1] * i % mod;
    }
    for(i = 2; i <= n; i++){
        sum = 0;
        for(j = 2; j <= i; j++){
            for(ii = j - 1; ii <= i - 1; ii++){
                d[i][j] = (d[i][j] + d[ii][j - 1] * d[i - ii][1]) % mod;
            }
            sum = (sum + d[i][j]) % mod;
        }
        d[i][1] = f[i] - sum;
        if(d[i][1] < 0){
            d[i][1] += mod;
        }
    }
    fout<< d[n][k] <<"\n";
    return 0;
}