#include<cstdio>
#include<set>
#define FIT(a,b) for(vector<pair<pair<int,int>,int> > >::iterator a=b.begin();a!=b.end();a++)
#include<stack>
#define ROF(a,b,c) for(register int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(register int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#include<map>
#define debug cerr<<"OK";
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define mod 666013
#define N 5010
using namespace std;
/*ifstream f("a.in");
ofstream g("a.out");*/
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
long long n,k,P[N],sol;
int nb[N];
int main ()
{
    freopen("kperm.in","r",stdin);
    freopen("kperm.out","w",stdout);
    scanf("%d%d",&n,&k);
    if(1LL*k*(k+1)/2%k)
    {
    	printf("0");
    	return 0;
    }
    P[0]=1;
    FOR(i,1,n)
    {
		P[i]=P[i-1]*i%mod;
		nb[i%k]++;
    }
    sol=P[k-n%k]*P[n%k]%mod;
    FOR(i,0,k-1)
    sol=sol*P[nb[i]]%mod;
    printf("%lld",sol);
    return 0;
}
//Look at me! Look at me! The monster inside me has grown this big!