#include <bits/stdc++.h>
#include <math.h>

#include <algorithm>
#include <array>
#include <atcoder/all>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>

using namespace std;
using namespace atcoder;

using Graph = vector<vector<int>>;

using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;

const ll INF_ll = 1e17;
const int INF = 1e8;
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main() {
  int N;
  cin >> N;
  long double p;
  cin >> p;
  vector<ll> cnt(N + 1, 0);
  ll x = 0;
  for (ll i = 2; i <= N; i++) {
    for (ll j = 2; i * j <= N; j++) {
      cnt[i * j]++;
      chmax(x, cnt[i * j]);
    }
  }
  vector<long double> pow(x + 1, 1);
  for (int i = 0; i < x; i++) {
    pow[i + 1] = pow[i] * (1 - p);
  }
  long double ans = 0;
  for (int i = 2; i <= N; i++) {
    ans += pow[cnt[i]];
  }
  cout << fixed << setprecision(12) << ans << endl;

  return 0;
}