#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,fma,tune=native")
#include<bits/stdc++.h>
using namespace std;
const int maxn = 330, mod = 10007;
int n, k, fact[maxn], part[maxn], dp[maxn][maxn];
void setup() {
	fact[0] = 1;
	for(int i = 1; i < maxn; i++) fact[i] = (fact[i-1]*i)%mod;
	part[1] = part[2] = 1;
	for(int i = 3; i < maxn; i++) {
		part[i] = fact[i];
		for(int j = 1; j < i; j++) 
			part[i] = (mod + part[i] - (fact[i-j]*part[j]%mod))%mod;
	}
}
int main() {
	freopen("permutari2.in", "r", stdin);
	freopen("permutari2.out", "w", stdout);
	setup();
	cin >> n >> k;
	dp[0][0] = 1;
	for(int len = 1; len <= n; len++) {
		for(int cnt = 1; cnt <= len; cnt++) {
			for(int plen = 0; plen < len; plen++) {
				dp[len][cnt] += dp[plen][cnt-1]*part[len-plen]%mod;
				if(dp[len][cnt]>=mod) dp[len][cnt] -= mod;
			}
		}
	}
	cout << dp[n][k] << '\n';
	
}