#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
#include <time.h>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,int> P;

int d[1100000];

int main(){
    int N;
    double p,ans=0.0;
    cin>>N>>p;

    for(int k=2;k<=N;k++){
        for(int m=k;m<=N;m+=k){
            d[m]++;
        }
        ans+=pow(1-p,d[k]-1);
    }
    printf("%.6lf\n",ans);
}