#include <bits/stdc++.h>
using namespace std;
double dp[220][220];
int n, k;
double p;
int calc(int k) {
  int ret = 0;
  while (k % 2 == 0) {
    k /= 2;
    ret++;
  }
  return ret;
}
int main() {
  scanf("%d%d%lf", &n, &k, &p);
  p /= 100;
  for (int i = 0; i <= k; ++i) dp[0][i] = calc(n + i);
  for (int t = 1; t <= k; ++t) {
    for (int z = 0; z <= k; ++z) {
      if (z % 2 == 0) dp[t][z] += p * (dp[t - 1][z / 2] + 1);
      if (z + 1 <= k) dp[t][z] += (1 - p) * (dp[t - 1][z + 1]);
    }
  }
  printf("%.12lf\n", dp[k][0]);
  return 0;
}
