#include <iostream>
#include <fstream>
#include <stdio.h>
#define mod 666013
using namespace std;
int n, k, r, c ;

void citire()
{
    ifstream in("kperm.in");

    in>>n>>k;

    c=n/k;

    r=n%k;
}

long long factorial(int n)
{
    long long i, ans=1 ;

    for(i=1; i<=n; i++)
    {
        ans=(1LL*ans*i)%mod;
    }

    return (1LL*ans)%mod;
}

long long putere(int n, int k)
{
    long long ans=1, i;

    for(i=1; i<=k; i++)
    {
        ans=(1LL*ans*n)%mod;
    }

    return (1LL*ans)%mod;
}

int main()
{

    ofstream out("kperm.out");

    long long answer;

    citire();

    if(k%2)
    {
        answer=(1LL*factorial(r)*factorial(k-r)*putere(factorial(c+1),r)*putere(factorial(c),k-r))%mod;

        out<<answer;
    }
    else
    {
        out<<0;
    }

    return 0;
}