#include <bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

const int N = 1e5 + 10;
const int mod = 1e9 + 7;

int p[N], cnt;
int lim;
int phi[N];
bool vis[N];
int sum[N];
int n, a;

void init() {
	phi[1] = 1;
	for (int i = 2; i <= lim; i++) {
		if (!vis[i]) phi[i] = i - 1, p[++cnt] = i;
		for (int j = 1; j <= cnt && 1ll * i * p[j] <= lim; j++) {
			vis[i * p[j]] = 1;
			if (i % p[j] == 0) {
				phi[i * p[j]] = phi[i] * p[j];
				break;
			} else phi[i * p[j]] = phi[i] * phi[p[j]];
		}
	}
	for (int i = 1; i <= lim; i++) sum[i] = (sum[i - 1] + phi[i]) % mod;
}

ll ksm(ll a, int b) {
	ll ans = 1;
	for (; b; b >>= 1, a = a * a % mod) {
		if (b & 1) ans = ans * a % mod;
	}
	return ans;
}

unordered_map <int, int> f;

ll Sum(int n) {
	if (n <= lim) return sum[n];
	if (f.count(n)) return f[n];
	ll now = 1ll * n * (n + 1) / 2;
	now %= mod;
	for (int l = 2, r; l <= n; l = r + 1) {
		r = n / (n / l);
		now = (now - Sum(n / l) * (r - l + 1) % mod + mod) % mod;
	}
	return f[n] = now;
}

ll cal(int l, int r) {
	return (ksm(a, r + 1) - ksm(a, l) + mod) * ksm(a - 1, mod - 2) % mod;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> a;
	if (a == 1) {
		cout << 2ll * n % mod * n % mod;
		return 0;
	}
	lim = 1e5;
	init();
	ll ans = 0;
	ll cnt = 0;
	for (int l = 1, r; l <= n; l = r + 1) {
		r = n / (n / l);
		ll w = 1;
		int x = n / l;
		w = (w + Sum(x)) % mod;
		x /= 2;
		while (x) w = (w - Sum(x) + mod) % mod, x /= 2;
		w = w * ksm(2, mod - 2) % mod;
		ans = (ans + cal(l, r) * w % mod) % mod;
		cnt = (cnt + (r - l + 1) * w % mod) % mod;
	}
	ans = (ans * 2 % mod - cal(1, n) + mod) % mod;
	cnt = (cnt * 2 % mod - n + mod) % mod;
	ans = (ans + 1ll * n * n % mod) % mod;
	if (a & 1) ans = (ans + 1ll * n * n - cnt) % mod;
	ans = (ans % mod + mod) % mod;
	cout << ans;
	QwQ330AwA;
}