#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {

    int N;
    double p;
    cin >> N >> p;

    vector<int> A(N+1,0);

    for ( int i = 2; i <= N; i++ ) {
        int a = i*2;
        while ( a <= N ) {            
            A[a]++;
            a += i;
        }
    }
    double ans = 0;
    for ( int i = 2; i <= N; i++ ) {
        ans += pow( (1-p), A[i] );
    }

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

    return 0;
}