#include <bits/stdc++.h>
using namespace std;
using LL = long long;
namespace _buff {
const size_t BUFF = 1 << 19;
char ibuf[BUFF], *ib = ibuf, *ie = ibuf;
char getc() {
  if (ib == ie) {
    ib = ibuf;
    ie = ibuf + fread(ibuf, 1, BUFF, stdin);
  }
  return ib == ie ? -1 : *ib++;
}
}  // namespace _buff
LL read() {
  using namespace _buff;
  LL ret = 0;
  bool pos = true;
  char c = getc();
  for (; (c < '0' || c > '9') && c != '-'; c = getc()) {
    assert(~c);
  }
  if (c == '-') {
    pos = false;
    c = getc();
  }
  for (; c >= '0' && c <= '9'; c = getc()) {
    ret = (ret << 3) + (ret << 1) + (c ^ 48);
  }
  return pos ? ret : -ret;
}
const size_t N = 2e5 + 5;
const int MOD = 1e9 + 7;
int qpow(int base, int e) {
  int ret = 1;
  for (; e; e >>= 1) {
    if (e & 1) {
      ret = (LL)ret * base % MOD;
    }
    base = (LL)base * base % MOD;
  }
  return ret;
}
int n, k, pw[N];
int mu[N];
bool npr[N];
vector<int> divs[N];
void prep() {
  vector<int> pri;
  mu[1] = 1;
  int m = n << 1;
  for (int i = 2; i <= m; ++i) {
    if (!npr[i]) {
      mu[i] = -1;
      pri.emplace_back(i);
    }
    for (int j : pri) {
      int k = i * j;
      if (k >= N) break;
      npr[k] = true;
      if (i % j == 0) {
        mu[k] = 0;
        break;
      }
      mu[k] = -mu[i];
    }
  }
  for (int i = 1; i <= m; ++i) {
    if (mu[i]) {
      for (int j = i; j <= m; j += i) {
        divs[j].emplace_back(i);
      }
    }
  }
  pw[0] = 1;
  pw[1] = qpow(k, MOD - 2);
  for (int i = 2; i <= m; ++i) {
    pw[i] = (LL)pw[i - 1] * pw[1] % MOD;
  }
}
int calc(int n, int l, int r) {
  if (l > r) return 0;
  int ret = 0;
  for (int d : divs[n]) {
    ret += mu[d] * (r / d - (l - 1) / d);
  }
  return ret;
}
int main() {
  n = read();
  k = read();
  prep();
  int ans = 0;
  for (int d = 1; d < n; ++d) {
    for (int s = 2; d * s <= 2 * (n - 1); ++s) {
      ans = (ans + (LL)pw[n - max(d * s - n, d)] *
                       calc(s, max(1, (d * s - n + d) / d),
                            min((n - 1) / d, s - 1))) %
            MOD;
    }
  }
  cout << ans << '\n';
  return 0;
}
