#include <fstream>
#include <cmath>
#include <vector>
#include <iomanip>
#include <queue>
#include <cstring>
#include <algorithm>
#include <queue>
#include <unordered_set>
#include <set>
#include <map>
#include <stack>
using namespace std;

ifstream cin("kperm.in");
ofstream cout("kperm.out");

const int MOD = 666013;
const int MAXN = 5000;

int factorial[1 + MAXN];

int main() {
    int n, k;
    cin >> n >> k;
    factorial[0] = 1;
    for (int i = 1; i <= n; i++)
        factorial[i] = ((long long) factorial[i - 1] * i) % MOD;
    int answer = 0, r = n % k;
    if (k % 2 == 1) {
        answer = ((long long) factorial[r] * factorial[k - r]) % MOD;
        for (int i = 1; i <= r; i++)
            answer = ((long long) answer * factorial[n / k + 1]) % MOD;
        for (int i = 1; i <= k - r; i++)
            answer = ((long long) answer *factorial[n / k]) % MOD;
    }
    cout << answer;
    return 0;
}