#include<iostream>
#include<cassert>
#include<iomanip>
#include<cmath>
using namespace std;
long double dp[100001];
int N,K;
long double P;
long double solve()
{
	{//k=0
		dp[0]=(pow(1/(1-P),N)-1)/P;
		dp[N]=0;
		for(int n=N-1;n>0;n--)
		{
			long double cur=1+(1-P)*dp[n+1]+P*dp[0];
			dp[n]=cur;
		}
	}
	int now=0;
	for(int k=1;k<=K;k++)
	{
		int l=-1,r=N;
		while(r-l>1)
		{
			int m=(l+r)/2;
			long double a=0,b=0;
			for(int n=N-1;n>=0;n--)
			{
				if(n>=m)a=1+(1-P)*a+P*dp[n],b=b*(1-P);
				else a=1+(1-P)*a,b=b*(1-P)+P;
			}
			//a+bx=x
			//x=a/(1-b)
			long double x=a/(1-b);
			if(dp[m]>x)l=m;
			else r=m;
		}
		{
			long double a=0,b=0;
			for(int n=N-1;n>=0;n--)
			{
				if(n>=r)a=1+(1-P)*a+P*dp[n],b=b*(1-P);
				else a=1+(1-P)*a,b=b*(1-P)+P;
			}
			//a+bx=x
			//x=a/(1-b)
			long double x=a/(1-b);
			dp[N]=0;
			dp[0]=x;
			for(int n=N-1;n>=1;n--)
			{
				if(n>=r)dp[n]=1+(1-P)*dp[n+1]+P*dp[n];
				else dp[n]=1+(1-P)*dp[n+1]+P*x;
			}
			//cout<<r<<" "<<dp[k][0]<<endl;
		}
		if(r==0)break;
		/*
		long double l=0,r=dp[k-1][0];
		for(int t=0;t<100;t++)
		{
			long double m=(l+r)/2;
			for(int n=N-1;n>=0;n--)
			{
				long double cur=1+(1-P)*dp[k][n+1]+P*min(dp[k-1][n],m);
				dp[k][n]=cur;
			}
			if(dp[k][0]<m)r=m;
			else l=m;
		}
		{
			for(int n=N-1;n>=0;n--)
			{
				long double cur=1+(1-P)*dp[k][n+1]+P*min(dp[k-1][n],l);
				dp[k][n]=cur;
			}
			cout<<l<<" "<<dp[k][0]<<endl;
		}
		*/
	}
	return dp[0];
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N>>K>>P;
	cout<<fixed<<setprecision(16)<<solve()<<endl;
}