#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    double p;
    is >> n >> p;

    Vec ps(n+9, 0);
    for(Num i{2}; i<=n; ++i) {
        for(Num j=i+i; j<=n; j+=i) {
            ps.at(j) += 1;
        }
    }

    double total {0};
    for(Num i{2}; i<=n; ++i) {
        const auto cnt = ps.at(i);
        if (ps.at(i) == 0) {
            total += 1;
        } else {
            total += std::pow(1.0 - p, cnt);
        }
    }

    os << std::setprecision(20) << total << "\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}