#include <bits/stdc++.h>

using namespace std;

using ll=long long;
using ld=long double;
using P=array<ll,2>;
#define rep(i,n) for (ll i=0;i<(n);i++)
#define rep2(i,a,b) for (ll i=(a);i<(b);i++)
#define repd(i,a,b) for (ll i=(a);i>=(b);i--)
#define popcount __builtin_popcountll
#define cin(a) ll a; cin >> a;
#define cin2(a,b) ll a,b; cin >> a >> b;
#define cin3(a,b,c) ll a,b,c; cin >> a >> b >> c;
#define cinvec(v) vector<ll> v(N); rep(i,N) cin >> v[i];
#define cinvec2(v,n) vector<ll> v(n); rep(i,n) cin >> v[i];
#define cins(s) string s; cin >> s;
#define cinc(c) char c; cin >> c;
vector<ll> dx = {0,-1,0,1},dy = {1,0,-1,0}, ddx = {0,-1,-1,-1,0,1,1,1}, ddy = {1,1,0,-1,-1,-1,0,1};
void yesno(bool b) {cout << (b?"Yes":"No") << endl;}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}

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

	vector<ll> nokori(N+1, 0);
	for(ll i=2; i<=N; i++){
		for(ll j=i; j<=N; j+=i) nokori[j]++;
	}

	ld ans = 0;
	rep2(i, 2, N+1){
		ans += pow(1-p, nokori[i]-1);
	}

	cout << fixed << setprecision(10) << ans << endl;
    
    return 0;
}