#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
template <class T> void chmin(T &a, const T &b) noexcept { if (b < a) a = b; }
template <class T> void chmax(T &a, const T &b) noexcept { if (a < b) a = b; }
void debug_out() { cout << "\n"; }
template <class T, class... Args>
void debug_out(const T &x, const Args &... args) { cout << x << " "; debug_out(args...);}
#ifdef _DEBUG
  #define debug(...) debug_out(__VA_ARGS__)
#else
  #define debug(...) 
#endif

vector<ll> divisor(ll n) {
  vector<ll> res;
  for (ll i = 1; i*i <= n; ++i) {
    if (n%i != 0) continue;
    res.emplace_back(i);
    if (i*i != n) res.emplace_back(n/i);
  }
  return res;
}


int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  std::cout << std::fixed << std::setprecision(15);
  int n;
  long double p, ans = 0.0;
  cin >> n >> p;
  vector<int> div(n+1,0);
  for (int i = 2; i <= n; ++i) {
    for (int k = 0; k <= n; k+=i) {
      div[k]++;
    }
    ans += powl(1-p, div[i]-1);
  }
  cout << ans << endl;
  return 0;
}