#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

int main(){
	int N;
	cin >> N;

	double p;
	cin >> p;

	vector<double> v(N+1, 1.0);
	v[0] = v[1] = 0.0;

	vector<int> cnt(N+1, 0);

	for(int i=2; i<=N/2; i++){
		for(int j=2*i; j<=N; j+=i){
			cnt[j]++;
		}
	}

	double ans = 0;
	for(int i=2; i<=N; i++){
		ans += pow(1.0-p, cnt[i]);
	}

	printf("%.6f\n", ans);
	return 0;
}