#include <cstdio>
#define mod 666013
int n,m,r,c;
long long sol;
long long fact(long long x)
{
     long long rez=1;
     for (long long i=1;i<=x;i++) rez=(rez*i)%mod;

     return rez;
}
long long power(long long a,long long b)
{
    long long sol=1;
    for(;b;b>>=1)
    {
    if(b&1)   sol=(sol*a)%mod;
    a=(a*a)%mod;
    }
    return sol;
}
int main()
{
    freopen("kperm.in","r",stdin);
    freopen("kperm.out","w",stdout);
    scanf("%lld %lld",&n,&m);
    if (n%m==0)
    {
         c=n/m-1;
         r=m;
    }
    else {
             c=n/m;
             r=n%m;
         }
    if (m%2==0) printf("0\n");
    else {
              sol=(fact(r)*fact(m-r))%mod;
              sol=(sol*power(fact(c+1),r))%mod;
              sol=(sol*power(fact(c),m-r))%mod;
              printf("%lld\n",sol);
         }
}