//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#ifdef LOCAL
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
inline bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef LOCAL
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif // LOCAL

const int max_n = 201, inf = 1000111222;

ld dp[max_n][max_n] = {}, C[max_n][max_n] = {};


int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int a, b, k,  n;
    ld p;
    cin >> n >> k >> p;
    vector <ld> d(n + 1), P(n + 1), PP(n + 1);
    PP[0] = P[0] = 1;
    C[0][0] = 1;
    for (int i = 1; i < max_n; i++) {
        C[i][0] = C[i][i] = 1;
        for (int j = 1; j < i; j++) {
            C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
        }
    }
    for (int i = 1; i <= n; i++) {
        P[i] = P[i - 1] * p;
        PP[i] = PP[i - 1] * (1 - p);
    }
    d[0] = 1;
    d[1] = 0;
    cout << fixed;
    cout.precision(10);
    for (int i = 2; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            d[i] += d[i - j] * PP[j] * P[i - j];
        }
        d[i] /= 1 - P[i];
    }
    ld ans = 0;
    cout << fixed;
    cout.precision(10);
    dp[0][k] = 1;
    for (int i = 0; i + 1 < max_n; i++) {
        for (int j = 1; j <= k; j++) {
            dp[i + 1][j] += dp[i][j] * p;
            dp[i + 1][j - 1] += dp[i][j] * (1 - p);
        }
    }
    ld bad = 0;
    vector <ld> BB(n + 1);
    for (int day = 0; day < max_n; day++) {
        bad += dp[day][0];
        ld good = dp[day][1];
        ld GG = good;
        BB[0] = 1;
        for (int j = 1; j <= n; j++) {
            BB[j] = BB[j - 1] * bad;
        }
        for (int cnt = 2; cnt <= n; cnt++) {
            GG *= good;
            ans += C[n][cnt] * GG * BB[n - cnt] * PP[cnt];
        }
    }
    cout << ans << '\n';
    LOG(d[n]);
}