#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
ll MOD = 1000000007;
ll modpow(ll A,ll B,ll M){
    ll r = 1,p = A;
    while(B > 0){
        if(B % 2 == 1) r = (r * p) % M;
        p = (p * p) % M;
        B /= 2;
    }
    return r;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll N,P;
    cin >> N >> P;
    ll f = 1,g = 1;
    for(ll i = 1;i <= N;i++){
        f *= i;
        f %= MOD;
        g *= i;
        g %= (MOD - 1);
    }
    ll h = 0;
    for(ll i = P;i <= N;i *= P){
        h += N / i;
    }
    ll ans = modpow(f,g,MOD);
    ans *= h;
    ans %= MOD;
    cout << ans << endl;
}