#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
long long int powmod(long long int a, long long int k) {
  long long int ap = a, ans = 1;
  while (k) {
    if (k & 1) {
      ans *= ap;
      ans %= MOD;
    }
    ap = ap * ap;
    ap %= MOD;
    k >>= 1;
  }
  return ans;
}
long long int inv(long long int a) { return powmod(a, MOD - 2); }
int main() {
  int n, k;
  cin >> n >> k;
  long long int ans = 0;
  long long int kp[200020];
  kp[0] = 1;
  for (int i = 1; i <= 2 * n; i++) kp[i] = kp[i - 1] * k % MOD;
  vector<int> vd[200010];
  for (int i = 2; i <= 2 * n - 2; i++) {
    for (int j = 1; j * j <= i; j++) {
      if (i % j == 0) {
        vd[i].push_back(j);
        if (j * j < i) vd[i].push_back(i / j);
      }
    }
    sort(vd[i].begin(), vd[i].end());
  }
  for (int m = 2; m <= 2 * n - 2; m++) {
    vector<int> cnt(vd[m].size());
    for (int i = (int)vd[m].size() - 1; i >= 0; i--) {
      int d = vd[m][i];
      if (m <= n)
        cnt[i] = (m - 1) / d;
      else
        cnt[i] = (n - 1) / d - (m - n) / d;
      for (int j = i + 1; j < vd[m].size(); j++) {
        if (vd[m][j] % d == 0) cnt[i] -= cnt[j];
      }
    }
    for (int i = 0; i < vd[m].size(); i++) {
      (ans += cnt[i] * kp[max(vd[m][i], m - n)]) %= MOD;
    }
  }
  (ans *= inv(kp[n])) %= MOD;
  cout << ans << endl;
  return 0;
}
