#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll N;
double P;

vector<ll> enum_prime(ll n) {
  vector<ll> prime;
  vector<bool> p(n + 1, true);
  p[0] = p[1] = false;
  REP(i, 2, n + 1) if(p[i]) for(ll j = i * 2; j < n + 1; j += i) p[j] = false;
  REP(i, 0, n + 1) if(p[i]) prime.push_back(i);
  return prime;
}

ll prime_factor(ll n, vector<ll> &prime) {
  ll factor = 1;
  REP(i, 0, prime.size()) {
    ll cnt = 1;
    while(n % prime[i] == 0) {
      n /= prime[i];
      cnt++;
    }
    factor *= cnt;
  }
  if(n > 1) factor *= 2;
  return factor;
}

double power(double a, ll n) {
  if(n == 0) return 1.0;
  if(n % 2 == 0) return power((a * a), n / 2);
  return (a * power(a, n - 1));
}

int main(void) {
  cin >> N >> P;

  vector<ll> prime = enum_prime(1001);

  double ans = 0;
  REP(i, 2, N + 1) ans += power(1.0 - P, prime_factor(i, prime) - 2);

  printf("%.15lf\n", ans);
}