#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, P = 1e9 + 7;
int n, k, ans, phi[N], s[N], v[N], p[N], pw[N];
int inv(int x) { return x == 1 ? x : 1LL * (P - P / x) * inv(P % x) % P; }
int main() {
  scanf("%d%d", &n, &k), phi[1] = s[1] = 1;
  for (int i = 2; i <= n; ++i) {
    if (!v[i]) p[++p[0]] = i, phi[i] = i - 1;
    for (int j = 1; j <= p[0] && i * p[j] <= n; ++j) {
      v[i * p[j]] = 1, phi[i * p[j]] = phi[i] * (p[j] - 1);
      if (i % p[j] == 0) {
        phi[i * p[j]] = phi[i] * p[j];
        break;
      }
    }
    s[i] = (s[i - 1] + phi[i]) % P;
  }
  for (int i = pw[0] = 1; i <= n; ++i) pw[i] = 1LL * pw[i - 1] * k % P;
  pw[0] = 0;
  for (int i = 1; i < n - 1; ++i) (ans += 1LL * pw[i] * (n - i - 1) % P) %= P;
  for (int i = 1; i < n; ++i)
    (ans += 1LL * (s[(n - 1) / i + 1] - s[1] + P) * pw[i] % P) %= P;
  for (int i = 1, x; i < n; ++i)
    x = (n - 1) / i + 1, (ans += P - 1LL * phi[x] * pw[x * i - n] % P) %= P;
  printf("%lld", 1LL * ans * inv(pw[n]) % P);
  return 0;
}
