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

void citire()
{
    freopen("kperm.in", "r", stdin);

    scanf("%d %d", &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=(ans*i)%mod;
    }

    return ans%mod;
}

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

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

    return ans%mod;
}

int main()
{

    freopen("kperm.out", "w", stdout);

    long long answer;

    citire();

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

        printf("%Ld", answer);
    }
    else
    {
        printf("%d", 0);
    }

    return 0;
}