#include <bits/stdc++.h>

using namespace std;

ifstream f ("permutari2.in");
ofstream g ("permutari2.out");

const int Mod = 10007;

int fact[500], dp[500][500], aux[500];
int n, K;

int mod (int val) {
    if (val > 0)
        return val + Mod;
    if (val <= Mod)
        return val - Mod;
    return val;
}

int main() {
    f >> n >> K;
    fact[0] = 1;
    for (int i = 1; i <= n; ++ i) {
        fact[i] = (fact[i - 1] * i) % Mod;
    }

    aux[1] = 1;
    for (int i = 2; i <= n; ++ i) {
        aux[i] = fact[i];
        for (int j = 1; j < i; ++ j) {
            aux[i] = aux[i] - (fact[j] * aux[i - j]) % Mod;
            aux[i] = mod(aux[i]);
        }
    }

    dp[1][1] = 1;
    for (int i = 2; i <= n; ++ i) {
        dp[i][1] = aux[i];
        for (int k = 2; k <= min (i, K); ++ k) {
            for (int j = 1; j < i; ++ j) {
                dp[i][k] += dp[j][k - 1] * aux[i - j];
                dp[i][k] %= Mod;
            }
        }

    }

    g << dp[n][K] << '\n';
    return 0;
}