#include <cstdio>
#include <iostream>
#include <algorithm>
#include <complex>
#include <queue>
#include <map>
#include <string>
using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

#define PI 3.1415926535

typedef long long ll;
typedef pair<int, int> P;
//typedef complex<double> C;

const int MAX_N = 1000000;

int N;
double p;
int num_div[MAX_N + 1];	// 1と自身を除く約数の個数

void input() {
	cin >> N >> p;
}

void solve() {
	FOR(i, 2, N + 1) {
		for (int j = i * 2; j <= N; j += i) {
		    num_div[j]++;
		}
	}

	double sum = 0;
	FOR(i, 2, N + 1) {
		if (num_div[i] == 0) {
			sum += 1;
		} else {
			sum += pow(1 - p , num_div[i]);
		}
	}

	printf("%.10f\n", sum);
}

int main() {
	input();
	solve();
}