#include <fstream>
#define MODULO 666013
using namespace std;
long long factorial(long long n)
{
    long long k=1;
    for(long long i=1; i<=n; ++i)
        k=k*i%MODULO;
    return k;
}
long exponential(long long n, long long pow)
{
    long long k=1;
    for(long long i=0; i<pow; ++i)
        k=k*n%MODULO;
    return k;
}
int main()
{
    ifstream in("kperm.in");
    ofstream out("kperm.out");
    long long n, k, ax;
    in>>n>>k;
    if(k%2==0)
        out<<"0\n";
    else
    {
        ax=factorial(n/k);
        out<<factorial(n%k)*exponential(ax*(n/k+1), n%k)*factorial(k-n%k)*exponential(ax, k-n%k)%MODULO<<'\n';
    }
    in.close(); out.close();
    return 0;
}