#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, pair<long long, long long> > &a,
               const pair<long long, pair<long long, long long> > &b) {
  return (a.second.first < b.second.first);
}
bool sortbyth(const pair<long long, pair<long long, long long> > &a,
              const pair<long long, pair<long long, long long> > &b) {
  return (a.second.second < b.second.second);
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long min(long long a, long long b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }
long long max3(long long a, long long b, long long c) {
  return max(max(a, b), c);
}
long long max4(long long a, long long b, long long c, long long d) {
  return max(max(a, b), max(c, d));
}
long long min3(long long a, long long b, long long c) {
  return min(min(a, b), c);
}
long long min4(long long a, long long b, long long c, long long d) {
  return min(min(a, b), min(c, d));
}
long long po(long long x, long long n, long long mod = 998244353) {
  if (n == 0) {
    return 1;
  }
  long long m = po(x, n / 2, mod);
  m *= m;
  m %= mod;
  if (n % 2) {
    m *= x;
    m %= mod;
  }
  return m;
}
long long n, t;
long double p;
long double dp[2005][2005];
long double solve(long long index, long long ti_me) {
  if (index == n) {
    return 0.0;
  }
  if (ti_me == t) {
    return 0.0;
  }
  if (dp[index][ti_me] != -1) {
    return dp[index][ti_me];
  }
  dp[index][ti_me] =
      ((long double)solve(index + 1, ti_me + 1) + 1.0) * (long double)p +
      (long double)solve(index, ti_me + 1) * (1.0 - (long double)p);
  return dp[index][ti_me];
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  clock_t startTime = clock();
  cin >> n >> p >> t;
  for (long long i = 0; i < 2005; i++) {
    for (long long j = 0; j < 2005; j++) {
      dp[i][j] = -1;
    }
  }
  cout << setprecision(10) << solve(0, 0) << "\n";
}
