#include <bits/stdc++.h>
using namespace std;
namespace FGF {
int n, m;
const int N = 2e5 + 5, mo = 1e9 + 7;
int p[N], phi[N], s[N], cnt, ans, c[N];
int qpow(int x, int y) {
  int s = 1;
  while (y) {
    if (y & 1) s = 1ll * s * x % mo;
    x = 1ll * x * x % mo;
    y >>= 1;
  }
  return s;
}
void init() {
  phi[1] = 1;
  for (int i = 2; i <= n; i++) {
    if (!phi[i]) p[++cnt] = i, phi[i] = i - 1;
    for (int j = 1; j <= cnt && p[j] * i <= n; j++) {
      if (i % p[j] == 0) {
        phi[i * p[j]] = phi[i] * p[j];
        break;
      }
      phi[i * p[j]] = phi[i] * (p[j] - 1);
    }
  }
}
void work() {
  scanf("%d%d", &n, &m);
  init();
  for (int i = 2; i <= n; i++) s[i] = (s[i - 1] + phi[i]) % mo;
  for (int i = 1; i < n - 1; i++) c[i] = n - i - 1;
  for (int i = 1, d; i < n; i++)
    d = (n - 1) / i, c[i] = (c[i] + s[d + 1]) % mo,
    c[(d + 1) * i - n] = (c[(d + 1) * i - n] - phi[d + 1] + mo) % mo;
  for (int i = 1, k = m; i < n; i++, k = 1ll * k * m % mo)
    ans = (ans + 1ll * c[i] * k % mo) % mo;
  printf("%lld", 1ll * ans * qpow(m, mo - 1 - n) % mo);
}
}  // namespace FGF
int main() {
  FGF::work();
  return 0;
}
