#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1;
const int mod = 1e9 + 7;
int add(int a, int b) {
  a += b;
  if (a >= mod) a -= mod;
  return a;
}
int sub(int a, int b) {
  a -= b;
  if (a < 0) a += mod;
  return a;
}
int mul(int a, int b) { return 1ll * a * b % mod; }
int Pow(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = mul(ans, a);
    a = mul(a, a);
    b >>= 1;
  }
  return ans;
}
vector<int> p[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int k;
  cin >> k;
  for (int i = 2; i < N; ++i)
    if (p[i].empty())
      for (int j = i; j < N; j += i) p[j].push_back(i);
  int ans = 0;
  for (int i = 1; i < n; ++i) ans = add(ans, Pow(k, mod - 1 + n - i));
  for (int g = 1; g < n; ++g)
    for (int s = 3; s < n + n; ++s) {
      if (s * g > n + n - 2) break;
      int l = max(1, s - (n - 1) / g) - 1;
      int r = min(s - 1, (n - 1) / g);
      if (l >= r) continue;
      int cur = 0;
      for (int m = 0; m < (1 << p[s].size()); ++m) {
        int d = 1;
        for (int i = 0; i < p[s].size(); ++i)
          if (m >> i & 1) d *= p[s][i];
        int x = r / d - l / d;
        if (__builtin_popcount(m) & 1)
          cur -= x;
        else
          cur += x;
      }
      ans = add(ans, mul(Pow(k, max(s * g - n, g)), cur));
    }
  cout << mul(ans, Pow(k, mod - 1 - n)) << endl;
}
