#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cstdio>

using namespace std;
const int mod=2007;
int f[101][101][101],n,K;
int ans[101][101];

inline int F(int a,int b,int c)
{
	return (a<0 || b<0 || c<0) ? 0 : f[a][b][c];
}

int MOD(int x)
{
	while (x<0) x+=mod;
	while (x>=mod) x-=mod;
	return x;
}

void solve()
{
	memset(f,0,sizeof(f));
	for (int k=1;k<=n;k++) f[1][0][k]=1;
	for (int i=2;i<=n;i++)
	for (int j=0;j<i;j++)
	{
		int s=0;
		for (int l=1;l<=n-i+2;l++) s = MOD( s+f[i-1][j][l] );
		for (int k=1;k<=n-i+1;k++)
		{
			s = MOD( s + F(i-1,j-1,k) - f[i-1][j][k]);
			f[i][j][k] = s;
		}
	}
	for (int j=0;j<=100;j++)
	ans[n][j]=f[n][j][1];
}

int main()
{
	freopen("permutation.in","r",stdin);
	freopen("permutation.out","w",stdout);
	for (n=1;n<=100;n++) solve();
	while (scanf("%d%d",&n,&K)!=EOF)
	{
		printf("%d\n",ans[n][K]);
	}
	return 0;
}