#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1'000'000'007;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

// 約数の個数の配列
// 1 から n まで
// O(n log n)
//   n + n / 2 + n / 3 + ... + n / n = n log n
vector<int> numberOfDivisors(int n) {
	vector<int> num(n + 1);
	for (int i = 1; i <= n; i++)
		for (int j = i; j <= n; j += i)
			num[j]++;
	return num;
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(7);
	int N; double p; cin >> N >> p;
	double ans = 0;

	vector<int> num = numberOfDivisors(N);

	vector<double> pw = { 1 };
	int maxi = *max_element(all(num));
	rep(i, 0, maxi)
		pw.push_back(pw.back()*(1 - p));
	dump(pw);
	rep(i, 2, N + 1) {
		ans += pw[num[i] - 2];
	}
	cout << ans << endl;
	return 0;
}