#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)
#define tenll(x) ((ll)1e##x)
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }


double prime[ten(7) + 1];

int main(){
	int n; cin >> n;
	double p; cin >> p;
	FOR(i, n + 1) prime[i] = 1.0;
	prime[0] = prime[1] = 0;
	for (int i = 2; i <= n; i++) {
		for (int j = i * 2; j <= n; j += i) prime[j] *= (1 - p);
	}
	double ans = accumulate(prime, prime + n + 1, 0.0);
	printf("%.10lf\n", ans);
}