#include<cstdio>
#include<cmath>
using namespace std;

long long factorial(int n)
{
  return (n == 1 || n == 0) ? 1 : factorial(n - 1) * n;
}
int main()
{
	freopen("kperm.in","r",stdin);
	freopen("kperm.out","w",stdout);
	int n,k,c,r;
	long long rez=1;

	scanf("%d %d",&n,&k);
	
	if(n%2==0)printf("0");
	else
	{
		c=n/k;
		r=n%k;
		rez=(factorial(r)%666013);
		rez*=(factorial(k-r)%666013);
		rez*=((long long)pow((double)factorial(c+1),r)%666013);
		rez*=((long long)pow((double)factorial(c),k-r)%666013);


		printf("%lld",rez);
	}
	return 0;
}