#include <fstream>

using namespace std;

ifstream fin("kperm.in");
ofstream fout("kperm.out");

const int mod= 666013;
const int nmax= 5000;

int f[nmax+1];

int lgpow( int x, int y ) {
    int sol= 1;
    while ( y>0 ) {
        if ( y%2==1 ) {
            sol= (sol*x)%mod;
            --y;
        }
        x= (x*x)%mod;
        y/= 2;
    }

    return sol;
}

int main(  ) {
    f[0]= 1;
    for ( int i= 1; i<=nmax; ++i ) {
        f[i]= (f[i-1]*i)%mod;
    }

    int n, k;
    fin>>n>>k;

    int sol= 0;
    if ( k%2==1 ) {
        sol= (f[k-n%k]*f[n%k]%mod)*(lgpow(f[n/k+1], n%k)*lgpow(f[n/k], k-n%k)%mod)%mod;
    }
    fout<<sol<<"\n";

    return 0;
}