#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

ll modpow(ll a, ll n, ll m) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % m;
        a = a * a % m;
        n >>= 1;
    }
    return res;
}

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	ll N, P;
	cin >> N >> P;
	
	const ll MOD = 1000000007ll;
	
	ll t = N;
	ll ans = 0;
	while (t > 0) {
		ans += t / P;
		t /= P;
	}
	
	ll a = 1;
	rep(i, 1, N + 1) a = a*i % MOD;
	ll b = 1;
	rep(i, 1, N + 1) b = b*i % (MOD - 1);
	
	ans *= modpow(a, b, MOD);
	ans %= MOD;
	cout << ans << '\n';
}