#include <bits/stdc++.h>
using namespace std;
long double dp[2001][2001];
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = ((res % p) * (x % p)) % p;
    y = y >> 1;
    x = ((x % p) * (x % p)) % p;
  }
  return res;
}
long long raichu(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = ((res) * (x));
    y = y >> 1;
    x = ((x) * (x));
  }
  return res;
}
bool isprime(long long n) {
  if (n < 2)
    return false;
  else if (n == 2)
    return true;
  else if (n % 2 == 0)
    return false;
  else {
    long long z = sqrt(n);
    for (int i = 0; i < z - 1; i++)
      if (n % (i + 2) == 0) return false;
    return true;
  }
}
long double solve(long long n, long double p, long double q, long long t) {
  if (t == 0 || n == 0)
    return 0;
  else if (dp[n][t] != -1)
    return dp[n][t];
  else {
    long double temp =
        p * (solve(n - 1, p, q, t - 1) + 1) + q * solve(n, p, q, t - 1);
    dp[n][t] = temp;
    return temp;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, t;
  long double p, q = 1;
  cin >> n >> p >> t;
  q -= p;
  for (int i = 0; i < 2001; i++)
    for (int j = 0; j < 2001; j++) dp[i][j] = -1;
  long double ans = solve(n, p, q, t);
  cout << setprecision(10) << ans;
  return 0;
}
