#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
double p, dp[N][N];
int n, t;
double solve(int rem, int time) {
  if (!time) return n - rem;
  double &ret = dp[rem][time];
  if (ret == ret) return ret;
  double ans;
  if (rem)
    ans = solve(rem - 1, time - 1) * p + solve(rem, time - 1) * (1 - p);
  else
    ans = solve(rem, time - 1);
  return ret = ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> p >> t;
  memset(dp, -1, sizeof dp);
  cout << fixed << setprecision(6) << solve(n, t);
  return 0;
}
