#include <bits/stdc++.h>
using namespace std;
long long n, m, pim[200005], sum[200005], sta[200005], mi[200005], num[200005],
    ans, phi[200005], top;
long long add(long long x) { return x >= 1000000007 ? x - 1000000007 : x; }
long long jian(long long x) { return x < 0 ? x + 1000000007 : x; }
void prepare(long long n) {
  for (long long i = 2; i <= n; i++) {
    if (!pim[i]) {
      phi[i] = i - 1;
      sta[++top] = i;
    }
    for (long long t = 1; t <= top; t++) {
      if (i * sta[t] > n) break;
      pim[i * sta[t]] = 1;
      if (i % sta[t] == 0) {
        phi[i * sta[t]] = phi[i] * sta[t] % 1000000007;
        break;
      } else {
        phi[i * sta[t]] = phi[i] * (sta[t] - 1) % 1000000007;
      }
    }
  }
  for (long long i = 1; i <= n; i++) {
    sum[i] = add(phi[i] + sum[i - 1]);
  }
}
long long ksm(long long x, long long y) {
  long long ans = 1, t = x;
  while (y) {
    if (y & 1) ans = ans * t % 1000000007;
    t = t * t % 1000000007;
    y >>= 1;
  }
  return ans;
}
int main() {
  scanf("%lld%lld", &n, &m);
  prepare(n);
  mi[0] = 1;
  for (long long i = 1; i <= n; i++) mi[i] = mi[i - 1] * m % 1000000007;
  for (long long s = n; s <= 2 * n - 2; s++) {
    ans = (ans + mi[s - n] * (2 * n - s - 1)) % 1000000007;
  }
  for (long long p = 1; p < n; p++) {
    num[p] = add(num[p] + sum[(n - 1) / p + 1]);
    num[((n - 1) / p + 1) * p - n] =
        jian(num[((n - 1) / p + 1) * p - n] - phi[(n - 1) / p + 1]);
  }
  for (long long i = 0; i <= n; i++) ans = (ans + num[i] * mi[i]) % 1000000007;
  printf("%lld", ans * ksm(mi[n], 1000000007 - 2) % 1000000007);
}
