#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define bit_count __builtin_popcount
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
vi ret{2};
vi ok(100000, 0);
void makePrime(int n) {
	ret.reserve(n + 1);
	ok.resize(n + 1);
	for (int i = 4; i < n + 1; i += 2)
		ok[i] = 1;
	for (int i = 3; i < n + 1; ++i) {
		bool flg = true;
		each(a, ret) {
			if (i % a == 0) {
				flg = false;
				break;
			}
		}
		if (flg)
			ret.eb(i);
		for (int j = i * 2; j < n + 1; j += i) {
			++ok[j];
		}
	}
}
double solve() {
	var(int, n);
	var(double, p);
	p = 1 - p;
	makePrime(n);
	int cnt = 0;
	double cnt_d = 0.0;
	rep(i, 2, n + 1) {
		if (ok[i] == 0)
			++cnt;
		else
			cnt_d += pow(p, ok[i]);
	}
	return cnt + cnt_d;
}
int main() {
	cout << setprecision(12) << fixed;
	print(solve());
	return 0;
}