import std;

void main () {
    auto buf = readln.split.to!(int[]);
    int N = buf[0], P = buf[1];

    solve(N, P);
}

void solve (int N, int P) {
    const int MOD = 1_000_000_007;
    long factorialN = 1;
    foreach (i; 2..N+1) {
        factorialN *= i;
        factorialN %= MOD;
    }
    foreach (i; 2..N+1) {
        factorialN = modpow(factorialN, i, MOD);
    }

    long X = 0;
    {
        long base = P;
        while (N/base != 0) {
            X += N/P;
            base *= P;
        }
    }

    writeln((X*factorialN) % MOD);
}

long modpow (long x, long a, const long MOD) {
    if (a == 0) {
        return 1;
    }
    if (a == 1) {
        return x;
    }
    if (a % 2 == 1) {
        return (x * modpow(x, a-1, MOD)) % MOD;
    }
    long t = modpow(x, a/2, MOD);
    return (t * t) % MOD;
}