#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <fstream>

using namespace std;

int i,j,n,k;
int f[101][101];

int main()
{
    ifstream fin("permutation.in");
	ofstream fou("permutation.out");
	for (i=1;i<=100;i++)
	{
		f[0][i]=1;
	}
	f[1][2]=1;
	for (i=3;i<=100;i++)
	{
		f[1][i]=((i-1)*f[0][i-1]+2*f[1][i-1])%2007;
	}
	for (i=2;i<=100;i++)
	{
		for (j=i+1;j<=100;j++)
		{
			f[i][j]=((j-i)*f[i-1][j-1])+((i+1)*f[i][j-1])%2007;
		}
	}
	while (!fin.eof())
	{
		fin>>n>>k;
		fou<<f[k][n]<<endl;
	}
	fin.close();
	fou.close();
	return 0;
}