#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() {
    
    double ans = 0;
    int N;
    cin >> N;
    double p;
    cin >> p;
    
    for ( int i = 2; i <= N; i++ ) {
        
        int d = 0;
        for ( int j = 2; j*j <= i; j++ ) {
            if ( i%j == 0 ) { d += j*j == i ? 1 : 2; }
        }
        ans += pow( (1-p), d );
        
    }
    
    printf( "%f\n", ans );
    
    return 0;
}