#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int expmod(int a, int b) {
  while (b < 0) b += mod - 1;
  int rlt = 1;
  for (; b; b >>= 1, a = 1ll * a * a % mod)
    if (b & 1) rlt = 1ll * rlt * a % mod;
  return rlt;
}
int runs, p[200010], phi[200010], mu[200010];
vector<int> d[200010];
void ppm() {
  phi[1] = 1, mu[1] = 1;
  d[1] = {1};
  for (int i = 2; i < 200010; i++) {
    if (!phi[i]) p[++runs] = i, phi[i] = i - 1, mu[i] = -1, d[i] = {1, i};
    for (int j = 1; j <= runs && i * p[j] < 200010; j++) {
      int k = i * p[j];
      phi[k] = phi[i] * (p[j] - 1);
      if (i % p[j] == 0) {
        d[k] = d[i];
        phi[k] = phi[i] * p[j];
        break;
      }
      int sz = d[i].size();
      for (int l = 0; l < sz; l++)
        d[k].push_back(d[i][l]), d[k].push_back(d[i][l] * p[j]);
      mu[k] = -mu[i];
    }
  }
}
int calc(int x, int up) {
  int ans = 0;
  for (int a : d[x]) ans += (up / a) * mu[a];
  return ans;
}
int n, k;
int main() {
  ppm();
  scanf("%d%d", &n, &k);
  int ans = 0;
  for (int gc = 1; gc < n; gc++) {
    for (int sum = 2 * gc; sum <= 2 * (n - 1); sum += gc) {
      int cnt = calc(sum / gc, min(sum / gc - 1, (n - 1) / gc)) -
                calc(sum / gc, max(1, sum / gc - (n - 1) / gc) - 1);
      cnt /= 2;
      ans = (ans + 1ll * cnt * expmod(k, max(gc - n, sum - n * 2))) % mod;
    }
  }
  ans *= 2;
  ans %= mod;
  for (int i = 1; i < n; i++) ans = (ans + expmod(k, -i)) % mod;
  cout << ans;
}
