#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

#define X first
#define Y second


const ll mod = 1000000007;
//const ll mod = 998244353;



ll pew(ll a, ll b) {
    ll res = 1;
    while (b>0) {
        if (b&1) res = res*a%mod;
        b >>= 1;
        a = a*a%mod;
    }
    return res;
}



void solve() {
    ll n, k;
    cin >> n >> k;
    ld P;
    cin >> P;
    vector<ld> dp(k+1);
    dp[k] = 1;
    cout.precision(20);
    ld A = 0;
    for (ll i=0;;i++) {
        vector<ld> dp2(k+1);
        for (ll j=1;j<=k;j++) {
            dp2[j] += dp[j]*P;
            dp2[j-1] += dp[j]*(1-P);
        }
        ld S2 = 0;
        for (ll j=0;j<=k;j++) {
            S2 += dp2[j];
        }
        ld S = dp2[0];
        for (ll j=0;j+1<n;j++) {
            S *= (1-S2);
        }
        A += S*n;
        if (S2<1e-12) break;
        dp = dp2;
    }
    cout << 1-A << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    int T = 1;
    //cin >> T;
    while (T--) solve();
    return 0;
}