#include #include using namespace std; using namespace atcoder; using mint = modint1000000007; const int mod = 1000000007; using mint2 = atcoder::modint; const int mod2 = mod - 1; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, p; cin >> n >> p; mint ans = 0; vectorfact(n + 1, 1); vectorfact2(n + 1, 1); rep(i, n) { fact[i + 1] = fact[i] * (i + 1); fact2[i + 1] = fact2[i] * (i + 1); } mint memo = fact[n]; memo = pow_mod(memo.val(), fact2[n].val(), mod); rep2(i, 1, n + 1) { int cnt = 0; int ci = i; while (0 == ci % p) { cnt++; ci /= p; } ans += (mint)cnt * memo; } cout << ans.val() << endl; return 0; }