#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int MAX_N = (int)1e6 + 6;

int cnt[MAX_N];

// 1と自分自身を除く約数の個数
void divisor (int N ){
	for (int i = 2; i <= N; i++ ){
		for (int j = 2*i; j <= N; j += i ){
			cnt[j]++;
		} // end for
	} // end for		
}

int main()
{
	memset (cnt, 0, sizeof (cnt ) );
	ios_base::sync_with_stdio(0);
	int N; cin >> N;
	double p; cin >> p;

	divisor(N );
	double res = 0.;
	for (int i = 2; i <= N; i++ ){
		double curr = pow(1.- p, cnt[i] );
		cerr << curr << endl;
		res += curr;
	} // end for
//	for (int i = 2; i <= N; i++ )
//		cerr << cnt[i] << (i != N ? ' ' : '\n' );

	printf ("%.5lf\n", res );

	return 0;
}