#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint1000000007 mint;
typedef long long ll;

ll mod_pow(ll x, ll m, int P){
	ll ret = 1;
	ll tmp = x;
	while (m > 0){
		if (m&1){
			ret = ret * tmp % P;
		}
		m >>= 1;
		tmp = tmp * tmp % P;
	}
	return ret;
}

int main(){
	int n, p; cin >> n >> p;
	int x = n;
	mint tmp = 0;
	while (x > 0){
		x = x / p;
		tmp += x;
	}
	ll kr = 1;
	ll ks = 1;
	int mod = 1'000'000'007;
	for (int i=1; i<=n; i++){
		kr *= i;
		ks *= i;
		kr %= mod - 1;
		ks %= mod;
	}
	mint ar = mod_pow(ks, kr, mod);
	tmp *= ar;
	cout << tmp.val() << endl;
}