#include <algorithm>
using namespace std;

#define MOD 10007
#define DIM 305

int bst[DIM][DIM];
int f[DIM],v[DIM];
int n,k;

void init ()
{
    int i,j;

    f[0]=1;
    for (i=1; i<=n; ++i)
        f[i]=(f[i-1]*i)%MOD;
    v[1]=v[2]=1;
    for (i=3; i<=n; ++i)
    {
        v[i]=f[i];
        for (j=1; j<i; ++j)
            v[i]=(v[i]-(f[j]*v[i-j])%MOD+MOD)%MOD;
    }
}

void solve ()
{
    int i,j,l;

    bst[0][0]=1;
    for (i=0; i<n; ++i)
        for (j=0; j<k; ++j)
            if (bst[i][j])
                for (l=i+1; l<=n; ++l)
                    bst[l][j+1]=(bst[l][j+1]+bst[i][j]*v[l-i])%MOD;
    printf ("%d",bst[n][k]);
}

int main ()
{
    freopen ("permutari2.in","r",stdin);
    freopen ("permutari2.out","w",stdout);

    scanf ("%d%d",&n,&k);
    init ();
    solve ();

    return 0;
}