E(i,j)表示从i,j到满足条件的期望
///p(i,j)=c(i,j)*p^j*q^(i-j);
/// =c(i-1, j-1)*p^(j-1)*q^(i-j)*p+c(i-1, j)*p^j*q^(i-j-1)*q;
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
const int maxn=70;
long long c[maxn][maxn];
double P[maxn][maxn];//
double E[maxn][maxn];
void prework(int n, double p)
{
double q=1.0-p;
P[0][0]=1;
P[1][0]=q; P[1][1]=p;
for (int i=2; i<=n; ++i)
{
P[i][0]=P[i-1][0]*q;
P[i][i]=P[i-1][i-1]*p;
for (int j=1; j<i; ++j)
{
P[i][j]=P[i-1][j-1]*p+P[i-1][j]*q;
///p(i,j)=c(i,j)*p^j*q^(i-j);
/// =c(i-1, j-1)*p^(j-1)*q^(i-j)*p+c(i-1, j)*p^j*q^(i-j-1)*q;
//printf("%lf ", P[i][j]);//i个里面选j个成立的概率
}
//puts("");
}
}
int main ()
{
int n, m;
double p;
while (cin >> n >> m >> p)
{
prework(n, p);
memset (E, 0, sizeof(E));
if(n==0 && m==0 && p==0)break;
for (int i=n; i>=0; --i)
{
for (int j=n; j>=0; --j)
{
if(i>=m && j>=m)continue;
for (int k=i; k<=n; ++k)
{
for (int q=j; q<=n; ++q)
{
E[i][j]+=E[k][q]*P[n-i][k-i]*P[n-j][q-j];
}
}
E[i][j]+=1.0;
E[i][j]/=(1-P[n-i][0]*P[n-j][0]);
}
}
printf("%.6lf\n", E[0][0]);
}
return 0;
}
/*
2 1 0.3
3 1 0.01
*/