#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>

using namespace std;

int main() {
	int n;
	double p;
	cin >> n >> p;
	vector<double> pPrime(n + 1, 1.0);
	pPrime[0] = 0.0;
	pPrime[1] = 0.0;
	for (int i = 2; i <= n; ++i) {
		for (int k = i * 2; k <= n; k += i) {
			pPrime[k] *= 1.0 - p;
		}
	}
	sort(pPrime.begin(), pPrime.end());
	double result = accumulate(pPrime.begin(), pPrime.end(), 0.0);
	cout << setprecision(7) << result << endl;
	return 0;
}